/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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 10:02:22,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 10:02:22,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 10:02:22,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 10:02:22,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 10:02:22,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 10:02:22,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 10:02:22,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 10:02:22,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 10:02:22,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 10:02:22,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 10:02:22,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 10:02:22,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 10:02:22,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 10:02:22,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 10:02:22,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 10:02:22,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 10:02:22,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 10:02:22,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 10:02:22,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 10:02:22,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 10:02:22,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 10:02:22,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 10:02:22,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 10:02:22,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 10:02:22,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 10:02:22,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 10:02:22,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 10:02:22,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 10:02:22,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 10:02:22,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 10:02:22,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 10:02:22,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 10:02:22,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 10:02:22,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 10:02:22,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 10:02:22,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 10:02:22,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 10:02:22,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 10:02:22,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 10:02:22,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 10:02:22,490 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 10:02:22,557 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 10:02:22,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 10:02:22,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 10:02:22,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 10:02:22,562 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 10:02:22,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 10:02:22,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 10:02:22,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 10:02:22,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 10:02:22,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 10:02:22,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 10:02:22,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 10:02:22,565 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 10:02:22,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 10:02:22,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 10:02:22,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 10:02:22,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 10:02:22,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:02:22,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 10:02:22,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 10:02:22,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 10:02:22,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 10:02:22,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 10:02:22,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 10:02:22,567 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 10:02:22,567 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 10:02:23,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 10:02:23,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 10:02:23,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 10:02:23,036 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 10:02:23,037 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 10:02:23,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-12-23 10:02:23,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/369502097/eac3cce71ea54118b746b63d8ba26749/FLAGcce37ece0 [2020-12-23 10:02:23,926 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 10:02:23,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-12-23 10:02:23,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/369502097/eac3cce71ea54118b746b63d8ba26749/FLAGcce37ece0 [2020-12-23 10:02:24,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/369502097/eac3cce71ea54118b746b63d8ba26749 [2020-12-23 10:02:24,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 10:02:24,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 10:02:24,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 10:02:24,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 10:02:24,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 10:02:24,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e164dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24, skipping insertion in model container [2020-12-23 10:02:24,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 10:02:24,261 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~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[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~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[~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[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:02:24,618 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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c[14373,14386] [2020-12-23 10:02:24,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:02:24,633 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~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[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~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[~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[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:02:24,747 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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c[14373,14386] [2020-12-23 10:02:24,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:02:24,771 INFO L208 MainTranslator]: Completed translation [2020-12-23 10:02:24,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24 WrapperNode [2020-12-23 10:02:24,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 10:02:24,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 10:02:24,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 10:02:24,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 10:02:24,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 10:02:24,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 10:02:24,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 10:02:24,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 10:02:24,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (1/1) ... [2020-12-23 10:02:24,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 10:02:24,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 10:02:24,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 10:02:24,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 10:02:24,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (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 10:02:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 10:02:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 10:02:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 10:02:25,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 10:02:26,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 10:02:26,051 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-23 10:02:26,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:02:26 BoogieIcfgContainer [2020-12-23 10:02:26,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 10:02:26,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 10:02:26,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 10:02:26,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 10:02:26,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:02:24" (1/3) ... [2020-12-23 10:02:26,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edb60e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:02:26, skipping insertion in model container [2020-12-23 10:02:26,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:02:24" (2/3) ... [2020-12-23 10:02:26,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edb60e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:02:26, skipping insertion in model container [2020-12-23 10:02:26,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:02:26" (3/3) ... [2020-12-23 10:02:26,063 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-12-23 10:02:26,098 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 10:02:26,115 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 10:02:26,172 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 10:02:26,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 10:02:26,202 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 10:02:26,202 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 10:02:26,202 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 10:02:26,202 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 10:02:26,203 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 10:02:26,203 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 10:02:26,203 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 10:02:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-12-23 10:02:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:02:26,232 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:26,233 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 10:02:26,234 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:26,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1418405445, now seen corresponding path program 1 times [2020-12-23 10:02:26,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:26,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593241818] [2020-12-23 10:02:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:26,564 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 10:02:26,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593241818] [2020-12-23 10:02:26,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:26,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 10:02:26,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648172128] [2020-12-23 10:02:26,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 10:02:26,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:26,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 10:02:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:02:26,589 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 2 states. [2020-12-23 10:02:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:26,623 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2020-12-23 10:02:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 10:02:26,624 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-12-23 10:02:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:26,637 INFO L225 Difference]: With dead ends: 227 [2020-12-23 10:02:26,637 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 10:02:26,641 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 10:02:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 10:02:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-23 10:02:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-23 10:02:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2020-12-23 10:02:26,699 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 37 [2020-12-23 10:02:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:26,699 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2020-12-23 10:02:26,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 10:02:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2020-12-23 10:02:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:02:26,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:26,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] [2020-12-23 10:02:26,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 10:02:26,703 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:26,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2058913401, now seen corresponding path program 1 times [2020-12-23 10:02:26,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:26,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282849801] [2020-12-23 10:02:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:26,870 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 10:02:26,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282849801] [2020-12-23 10:02:26,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:26,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:02:26,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942922798] [2020-12-23 10:02:26,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:02:26,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:26,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:02:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:26,875 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand 5 states. [2020-12-23 10:02:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:27,034 INFO L93 Difference]: Finished difference Result 222 states and 378 transitions. [2020-12-23 10:02:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 10:02:27,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 10:02:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:27,037 INFO L225 Difference]: With dead ends: 222 [2020-12-23 10:02:27,038 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 10:02:27,039 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 10:02:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 10:02:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-23 10:02:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-23 10:02:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2020-12-23 10:02:27,052 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 37 [2020-12-23 10:02:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:27,052 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2020-12-23 10:02:27,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:02:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2020-12-23 10:02:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 10:02:27,055 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:27,056 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] [2020-12-23 10:02:27,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 10:02:27,056 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:27,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:27,057 INFO L82 PathProgramCache]: Analyzing trace with hash -415118785, now seen corresponding path program 1 times [2020-12-23 10:02:27,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:27,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097696340] [2020-12-23 10:02:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:27,247 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 10:02:27,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097696340] [2020-12-23 10:02:27,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:27,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:27,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300215409] [2020-12-23 10:02:27,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:27,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:27,251 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand 3 states. [2020-12-23 10:02:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:27,339 INFO L93 Difference]: Finished difference Result 287 states and 459 transitions. [2020-12-23 10:02:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:27,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 10:02:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:27,346 INFO L225 Difference]: With dead ends: 287 [2020-12-23 10:02:27,346 INFO L226 Difference]: Without dead ends: 208 [2020-12-23 10:02:27,347 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 10:02:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-12-23 10:02:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2020-12-23 10:02:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 10:02:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 320 transitions. [2020-12-23 10:02:27,386 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 320 transitions. Word has length 66 [2020-12-23 10:02:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:27,387 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 320 transitions. [2020-12-23 10:02:27,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 320 transitions. [2020-12-23 10:02:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 10:02:27,393 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:27,394 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] [2020-12-23 10:02:27,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 10:02:27,396 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:27,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash 928134868, now seen corresponding path program 1 times [2020-12-23 10:02:27,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:27,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063741945] [2020-12-23 10:02:27,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:27,614 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 10:02:27,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063741945] [2020-12-23 10:02:27,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:27,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:27,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214797609] [2020-12-23 10:02:27,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:27,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:27,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:27,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:27,621 INFO L87 Difference]: Start difference. First operand 206 states and 320 transitions. Second operand 3 states. [2020-12-23 10:02:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:27,680 INFO L93 Difference]: Finished difference Result 482 states and 776 transitions. [2020-12-23 10:02:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:27,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 10:02:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:27,690 INFO L225 Difference]: With dead ends: 482 [2020-12-23 10:02:27,690 INFO L226 Difference]: Without dead ends: 336 [2020-12-23 10:02:27,693 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:02:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-12-23 10:02:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2020-12-23 10:02:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-12-23 10:02:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 531 transitions. [2020-12-23 10:02:27,732 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 531 transitions. Word has length 68 [2020-12-23 10:02:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:27,733 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 531 transitions. [2020-12-23 10:02:27,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 531 transitions. [2020-12-23 10:02:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 10:02:27,739 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:27,740 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] [2020-12-23 10:02:27,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 10:02:27,741 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1295175881, now seen corresponding path program 1 times [2020-12-23 10:02:27,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:27,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604702528] [2020-12-23 10:02:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:27,910 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 10:02:27,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604702528] [2020-12-23 10:02:27,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:27,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:27,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2333033] [2020-12-23 10:02:27,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:27,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:27,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:27,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:27,916 INFO L87 Difference]: Start difference. First operand 334 states and 531 transitions. Second operand 3 states. [2020-12-23 10:02:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:27,978 INFO L93 Difference]: Finished difference Result 850 states and 1381 transitions. [2020-12-23 10:02:27,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:27,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-23 10:02:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:27,984 INFO L225 Difference]: With dead ends: 850 [2020-12-23 10:02:27,984 INFO L226 Difference]: Without dead ends: 576 [2020-12-23 10:02:27,985 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 10:02:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-12-23 10:02:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2020-12-23 10:02:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-12-23 10:02:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 923 transitions. [2020-12-23 10:02:28,011 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 923 transitions. Word has length 70 [2020-12-23 10:02:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:28,011 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 923 transitions. [2020-12-23 10:02:28,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 923 transitions. [2020-12-23 10:02:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 10:02:28,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:28,013 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] [2020-12-23 10:02:28,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 10:02:28,014 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash -367652834, now seen corresponding path program 1 times [2020-12-23 10:02:28,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:28,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731019036] [2020-12-23 10:02:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:28,183 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 10:02:28,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731019036] [2020-12-23 10:02:28,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:28,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:02:28,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141589409] [2020-12-23 10:02:28,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:02:28,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:02:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:28,186 INFO L87 Difference]: Start difference. First operand 574 states and 923 transitions. Second operand 5 states. [2020-12-23 10:02:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:28,456 INFO L93 Difference]: Finished difference Result 2176 states and 3592 transitions. [2020-12-23 10:02:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:02:28,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-23 10:02:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:28,468 INFO L225 Difference]: With dead ends: 2176 [2020-12-23 10:02:28,468 INFO L226 Difference]: Without dead ends: 1662 [2020-12-23 10:02:28,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:02:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2020-12-23 10:02:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1023. [2020-12-23 10:02:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2020-12-23 10:02:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1661 transitions. [2020-12-23 10:02:28,522 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1661 transitions. Word has length 72 [2020-12-23 10:02:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:28,522 INFO L481 AbstractCegarLoop]: Abstraction has 1023 states and 1661 transitions. [2020-12-23 10:02:28,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:02:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1661 transitions. [2020-12-23 10:02:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 10:02:28,524 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:28,525 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] [2020-12-23 10:02:28,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 10:02:28,525 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash -435168554, now seen corresponding path program 1 times [2020-12-23 10:02:28,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:28,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799309509] [2020-12-23 10:02:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:28,625 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 10:02:28,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799309509] [2020-12-23 10:02:28,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:28,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:02:28,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842158292] [2020-12-23 10:02:28,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:02:28,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:02:28,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:02:28,628 INFO L87 Difference]: Start difference. First operand 1023 states and 1661 transitions. Second operand 4 states. [2020-12-23 10:02:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:28,809 INFO L93 Difference]: Finished difference Result 2972 states and 4898 transitions. [2020-12-23 10:02:28,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:02:28,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-12-23 10:02:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:28,821 INFO L225 Difference]: With dead ends: 2972 [2020-12-23 10:02:28,822 INFO L226 Difference]: Without dead ends: 2009 [2020-12-23 10:02:28,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2020-12-23 10:02:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1507. [2020-12-23 10:02:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-12-23 10:02:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2459 transitions. [2020-12-23 10:02:28,888 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2459 transitions. Word has length 73 [2020-12-23 10:02:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:28,889 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 2459 transitions. [2020-12-23 10:02:28,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:02:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2459 transitions. [2020-12-23 10:02:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:02:28,891 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:28,891 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] [2020-12-23 10:02:28,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 10:02:28,892 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 152415701, now seen corresponding path program 1 times [2020-12-23 10:02:28,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:28,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510493114] [2020-12-23 10:02:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:28,955 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 10:02:28,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510493114] [2020-12-23 10:02:28,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:28,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:28,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682375466] [2020-12-23 10:02:28,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:28,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:28,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:28,958 INFO L87 Difference]: Start difference. First operand 1507 states and 2459 transitions. Second operand 3 states. [2020-12-23 10:02:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:29,039 INFO L93 Difference]: Finished difference Result 2973 states and 4868 transitions. [2020-12-23 10:02:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:29,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:02:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:29,052 INFO L225 Difference]: With dead ends: 2973 [2020-12-23 10:02:29,053 INFO L226 Difference]: Without dead ends: 2147 [2020-12-23 10:02:29,055 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:02:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2020-12-23 10:02:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2145. [2020-12-23 10:02:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2020-12-23 10:02:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3484 transitions. [2020-12-23 10:02:29,147 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3484 transitions. Word has length 74 [2020-12-23 10:02:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:29,164 INFO L481 AbstractCegarLoop]: Abstraction has 2145 states and 3484 transitions. [2020-12-23 10:02:29,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3484 transitions. [2020-12-23 10:02:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:02:29,165 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:29,166 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] [2020-12-23 10:02:29,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 10:02:29,166 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1935815765, now seen corresponding path program 1 times [2020-12-23 10:02:29,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:29,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675439124] [2020-12-23 10:02:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:29,239 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 10:02:29,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675439124] [2020-12-23 10:02:29,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:29,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:02:29,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197105001] [2020-12-23 10:02:29,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:02:29,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:29,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:02:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:02:29,249 INFO L87 Difference]: Start difference. First operand 2145 states and 3484 transitions. Second operand 4 states. [2020-12-23 10:02:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:29,512 INFO L93 Difference]: Finished difference Result 6648 states and 10865 transitions. [2020-12-23 10:02:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:02:29,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 10:02:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:29,537 INFO L225 Difference]: With dead ends: 6648 [2020-12-23 10:02:29,537 INFO L226 Difference]: Without dead ends: 4593 [2020-12-23 10:02:29,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2020-12-23 10:02:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3357. [2020-12-23 10:02:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3357 states. [2020-12-23 10:02:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 5442 transitions. [2020-12-23 10:02:29,711 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 5442 transitions. Word has length 74 [2020-12-23 10:02:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:29,712 INFO L481 AbstractCegarLoop]: Abstraction has 3357 states and 5442 transitions. [2020-12-23 10:02:29,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:02:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 5442 transitions. [2020-12-23 10:02:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:02:29,713 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:29,714 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] [2020-12-23 10:02:29,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 10:02:29,714 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2130170379, now seen corresponding path program 1 times [2020-12-23 10:02:29,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:29,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565988082] [2020-12-23 10:02:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:29,811 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 10:02:29,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565988082] [2020-12-23 10:02:29,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:29,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:29,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787404033] [2020-12-23 10:02:29,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:29,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:29,813 INFO L87 Difference]: Start difference. First operand 3357 states and 5442 transitions. Second operand 3 states. [2020-12-23 10:02:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:29,964 INFO L93 Difference]: Finished difference Result 6689 states and 10862 transitions. [2020-12-23 10:02:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:29,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:02:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:29,989 INFO L225 Difference]: With dead ends: 6689 [2020-12-23 10:02:29,990 INFO L226 Difference]: Without dead ends: 4777 [2020-12-23 10:02:29,995 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:02:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2020-12-23 10:02:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4775. [2020-12-23 10:02:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2020-12-23 10:02:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 7690 transitions. [2020-12-23 10:02:30,241 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 7690 transitions. Word has length 74 [2020-12-23 10:02:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:30,242 INFO L481 AbstractCegarLoop]: Abstraction has 4775 states and 7690 transitions. [2020-12-23 10:02:30,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 7690 transitions. [2020-12-23 10:02:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:02:30,244 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:30,244 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] [2020-12-23 10:02:30,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 10:02:30,245 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash 339461557, now seen corresponding path program 1 times [2020-12-23 10:02:30,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:30,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805548119] [2020-12-23 10:02:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:30,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 10:02:30,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805548119] [2020-12-23 10:02:30,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:30,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:30,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223497236] [2020-12-23 10:02:30,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:30,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:30,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:30,311 INFO L87 Difference]: Start difference. First operand 4775 states and 7690 transitions. Second operand 3 states. [2020-12-23 10:02:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:30,578 INFO L93 Difference]: Finished difference Result 10486 states and 17043 transitions. [2020-12-23 10:02:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:30,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:02:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:30,617 INFO L225 Difference]: With dead ends: 10486 [2020-12-23 10:02:30,617 INFO L226 Difference]: Without dead ends: 7079 [2020-12-23 10:02:30,625 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:02:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2020-12-23 10:02:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 7077. [2020-12-23 10:02:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7077 states. [2020-12-23 10:02:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 11375 transitions. [2020-12-23 10:02:31,029 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 11375 transitions. Word has length 74 [2020-12-23 10:02:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:31,029 INFO L481 AbstractCegarLoop]: Abstraction has 7077 states and 11375 transitions. [2020-12-23 10:02:31,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 11375 transitions. [2020-12-23 10:02:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 10:02:31,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:31,030 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] [2020-12-23 10:02:31,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 10:02:31,031 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:31,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1704077331, now seen corresponding path program 1 times [2020-12-23 10:02:31,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:31,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053207589] [2020-12-23 10:02:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:31,160 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 10:02:31,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053207589] [2020-12-23 10:02:31,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:31,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:02:31,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929929811] [2020-12-23 10:02:31,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:02:31,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:02:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:02:31,162 INFO L87 Difference]: Start difference. First operand 7077 states and 11375 transitions. Second operand 4 states. [2020-12-23 10:02:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:31,813 INFO L93 Difference]: Finished difference Result 22184 states and 35744 transitions. [2020-12-23 10:02:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:02:31,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 10:02:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:31,868 INFO L225 Difference]: With dead ends: 22184 [2020-12-23 10:02:31,869 INFO L226 Difference]: Without dead ends: 15193 [2020-12-23 10:02:31,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15193 states. [2020-12-23 10:02:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15193 to 11092. [2020-12-23 10:02:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11092 states. [2020-12-23 10:02:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11092 states to 11092 states and 17724 transitions. [2020-12-23 10:02:32,560 INFO L78 Accepts]: Start accepts. Automaton has 11092 states and 17724 transitions. Word has length 75 [2020-12-23 10:02:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:32,561 INFO L481 AbstractCegarLoop]: Abstraction has 11092 states and 17724 transitions. [2020-12-23 10:02:32,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:02:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 11092 states and 17724 transitions. [2020-12-23 10:02:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 10:02:32,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:32,562 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] [2020-12-23 10:02:32,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 10:02:32,564 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash 931672261, now seen corresponding path program 1 times [2020-12-23 10:02:32,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:32,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864931583] [2020-12-23 10:02:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:32,779 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 10:02:32,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864931583] [2020-12-23 10:02:32,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:32,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:02:32,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202812168] [2020-12-23 10:02:32,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:02:32,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:32,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:02:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:02:32,783 INFO L87 Difference]: Start difference. First operand 11092 states and 17724 transitions. Second operand 4 states. [2020-12-23 10:02:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:33,678 INFO L93 Difference]: Finished difference Result 32771 states and 52300 transitions. [2020-12-23 10:02:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:02:33,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 10:02:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:33,741 INFO L225 Difference]: With dead ends: 32771 [2020-12-23 10:02:33,741 INFO L226 Difference]: Without dead ends: 21688 [2020-12-23 10:02:33,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21688 states. [2020-12-23 10:02:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21688 to 21686. [2020-12-23 10:02:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21686 states. [2020-12-23 10:02:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21686 states to 21686 states and 34364 transitions. [2020-12-23 10:02:34,895 INFO L78 Accepts]: Start accepts. Automaton has 21686 states and 34364 transitions. Word has length 77 [2020-12-23 10:02:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:34,898 INFO L481 AbstractCegarLoop]: Abstraction has 21686 states and 34364 transitions. [2020-12-23 10:02:34,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:02:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 21686 states and 34364 transitions. [2020-12-23 10:02:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 10:02:34,900 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:34,900 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 10:02:34,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 10:02:34,900 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:34,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1466579386, now seen corresponding path program 1 times [2020-12-23 10:02:34,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:34,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797275929] [2020-12-23 10:02:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:34,958 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 10:02:34,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797275929] [2020-12-23 10:02:34,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:34,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:34,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729118424] [2020-12-23 10:02:34,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:34,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:34,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:34,961 INFO L87 Difference]: Start difference. First operand 21686 states and 34364 transitions. Second operand 3 states. [2020-12-23 10:02:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:36,299 INFO L93 Difference]: Finished difference Result 52581 states and 83824 transitions. [2020-12-23 10:02:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:36,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 10:02:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:36,379 INFO L225 Difference]: With dead ends: 52581 [2020-12-23 10:02:36,380 INFO L226 Difference]: Without dead ends: 31024 [2020-12-23 10:02:36,415 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:02:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31024 states. [2020-12-23 10:02:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31024 to 30112. [2020-12-23 10:02:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30112 states. [2020-12-23 10:02:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30112 states to 30112 states and 47587 transitions. [2020-12-23 10:02:37,737 INFO L78 Accepts]: Start accepts. Automaton has 30112 states and 47587 transitions. Word has length 78 [2020-12-23 10:02:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:37,737 INFO L481 AbstractCegarLoop]: Abstraction has 30112 states and 47587 transitions. [2020-12-23 10:02:37,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30112 states and 47587 transitions. [2020-12-23 10:02:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 10:02:37,739 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:37,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:37,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 10:02:37,740 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash 295226641, now seen corresponding path program 1 times [2020-12-23 10:02:37,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:37,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091759433] [2020-12-23 10:02:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:37,777 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 10:02:37,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091759433] [2020-12-23 10:02:37,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:37,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:37,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902537608] [2020-12-23 10:02:37,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:37,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:37,780 INFO L87 Difference]: Start difference. First operand 30112 states and 47587 transitions. Second operand 3 states. [2020-12-23 10:02:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:39,560 INFO L93 Difference]: Finished difference Result 90298 states and 142699 transitions. [2020-12-23 10:02:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:39,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 10:02:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:39,759 INFO L225 Difference]: With dead ends: 90298 [2020-12-23 10:02:39,759 INFO L226 Difference]: Without dead ends: 60214 [2020-12-23 10:02:39,821 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:02:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60214 states. [2020-12-23 10:02:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60214 to 30114. [2020-12-23 10:02:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30114 states. [2020-12-23 10:02:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30114 states to 30114 states and 47589 transitions. [2020-12-23 10:02:41,420 INFO L78 Accepts]: Start accepts. Automaton has 30114 states and 47589 transitions. Word has length 78 [2020-12-23 10:02:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:41,420 INFO L481 AbstractCegarLoop]: Abstraction has 30114 states and 47589 transitions. [2020-12-23 10:02:41,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30114 states and 47589 transitions. [2020-12-23 10:02:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 10:02:41,422 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:41,422 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 10:02:41,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:02:41,422 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash -57061967, now seen corresponding path program 1 times [2020-12-23 10:02:41,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:41,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7360066] [2020-12-23 10:02:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:41,529 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 10:02:41,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7360066] [2020-12-23 10:02:41,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:41,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:02:41,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803736942] [2020-12-23 10:02:41,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:02:41,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:02:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:02:41,532 INFO L87 Difference]: Start difference. First operand 30114 states and 47589 transitions. Second operand 4 states. [2020-12-23 10:02:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:43,134 INFO L93 Difference]: Finished difference Result 88984 states and 140445 transitions. [2020-12-23 10:02:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:02:43,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 10:02:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:43,285 INFO L225 Difference]: With dead ends: 88984 [2020-12-23 10:02:43,285 INFO L226 Difference]: Without dead ends: 58900 [2020-12-23 10:02:43,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58900 states. [2020-12-23 10:02:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58900 to 58898. [2020-12-23 10:02:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58898 states. [2020-12-23 10:02:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58898 states to 58898 states and 92344 transitions. [2020-12-23 10:02:45,669 INFO L78 Accepts]: Start accepts. Automaton has 58898 states and 92344 transitions. Word has length 79 [2020-12-23 10:02:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:45,669 INFO L481 AbstractCegarLoop]: Abstraction has 58898 states and 92344 transitions. [2020-12-23 10:02:45,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:02:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 58898 states and 92344 transitions. [2020-12-23 10:02:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 10:02:45,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:45,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:45,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:02:45,671 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1163177193, now seen corresponding path program 1 times [2020-12-23 10:02:45,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:45,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683982673] [2020-12-23 10:02:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:45,735 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 10:02:45,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683982673] [2020-12-23 10:02:45,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:45,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:45,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715734502] [2020-12-23 10:02:45,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:45,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:45,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:45,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:45,738 INFO L87 Difference]: Start difference. First operand 58898 states and 92344 transitions. Second operand 3 states. [2020-12-23 10:02:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:48,159 INFO L93 Difference]: Finished difference Result 142466 states and 224208 transitions. [2020-12-23 10:02:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:48,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 10:02:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:48,347 INFO L225 Difference]: With dead ends: 142466 [2020-12-23 10:02:48,348 INFO L226 Difference]: Without dead ends: 83848 [2020-12-23 10:02:48,424 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:02:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83848 states. [2020-12-23 10:02:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83848 to 81542. [2020-12-23 10:02:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81542 states. [2020-12-23 10:02:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81542 states to 81542 states and 127246 transitions. [2020-12-23 10:02:51,559 INFO L78 Accepts]: Start accepts. Automaton has 81542 states and 127246 transitions. Word has length 80 [2020-12-23 10:02:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:51,559 INFO L481 AbstractCegarLoop]: Abstraction has 81542 states and 127246 transitions. [2020-12-23 10:02:51,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 81542 states and 127246 transitions. [2020-12-23 10:02:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 10:02:51,560 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:51,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:51,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:02:51,561 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash -544448643, now seen corresponding path program 1 times [2020-12-23 10:02:51,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:51,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142962421] [2020-12-23 10:02:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:51,598 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 10:02:51,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142962421] [2020-12-23 10:02:51,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:51,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:51,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253001466] [2020-12-23 10:02:51,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:51,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:51,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:51,601 INFO L87 Difference]: Start difference. First operand 81542 states and 127246 transitions. Second operand 3 states. [2020-12-23 10:02:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:56,467 INFO L93 Difference]: Finished difference Result 244550 states and 381618 transitions. [2020-12-23 10:02:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:56,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 10:02:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:56,813 INFO L225 Difference]: With dead ends: 244550 [2020-12-23 10:02:56,815 INFO L226 Difference]: Without dead ends: 163052 [2020-12-23 10:02:56,904 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:02:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163052 states. [2020-12-23 10:03:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163052 to 81546. [2020-12-23 10:03:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81546 states. [2020-12-23 10:03:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81546 states to 81546 states and 127250 transitions. [2020-12-23 10:03:00,812 INFO L78 Accepts]: Start accepts. Automaton has 81546 states and 127250 transitions. Word has length 80 [2020-12-23 10:03:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:00,812 INFO L481 AbstractCegarLoop]: Abstraction has 81546 states and 127250 transitions. [2020-12-23 10:03:00,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 81546 states and 127250 transitions. [2020-12-23 10:03:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 10:03:00,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:00,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:00,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:03:00,814 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2051256477, now seen corresponding path program 1 times [2020-12-23 10:03:00,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:00,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689098858] [2020-12-23 10:03:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:00,921 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 10:03:00,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689098858] [2020-12-23 10:03:00,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:00,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:00,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149437508] [2020-12-23 10:03:00,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:00,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:00,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:00,924 INFO L87 Difference]: Start difference. First operand 81546 states and 127250 transitions. Second operand 4 states. [2020-12-23 10:03:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:06,635 INFO L93 Difference]: Finished difference Result 240890 states and 375346 transitions. [2020-12-23 10:03:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:06,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 10:03:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:06,926 INFO L225 Difference]: With dead ends: 240890 [2020-12-23 10:03:06,927 INFO L226 Difference]: Without dead ends: 159392 [2020-12-23 10:03:06,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159392 states. [2020-12-23 10:03:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159392 to 159390. [2020-12-23 10:03:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159390 states. [2020-12-23 10:03:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159390 states to 159390 states and 246600 transitions. [2020-12-23 10:03:13,435 INFO L78 Accepts]: Start accepts. Automaton has 159390 states and 246600 transitions. Word has length 81 [2020-12-23 10:03:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:13,435 INFO L481 AbstractCegarLoop]: Abstraction has 159390 states and 246600 transitions. [2020-12-23 10:03:13,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 159390 states and 246600 transitions. [2020-12-23 10:03:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 10:03:13,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:13,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:13,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:03:13,438 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:13,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2106822348, now seen corresponding path program 1 times [2020-12-23 10:03:13,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:13,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316785728] [2020-12-23 10:03:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:13,504 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 10:03:13,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316785728] [2020-12-23 10:03:13,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:13,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:13,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172555186] [2020-12-23 10:03:13,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:13,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:13,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:13,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:13,506 INFO L87 Difference]: Start difference. First operand 159390 states and 246600 transitions. Second operand 3 states. [2020-12-23 10:03:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:21,667 INFO L93 Difference]: Finished difference Result 386314 states and 600650 transitions. [2020-12-23 10:03:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:21,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 10:03:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:22,134 INFO L225 Difference]: With dead ends: 386314 [2020-12-23 10:03:22,135 INFO L226 Difference]: Without dead ends: 227488 [2020-12-23 10:03:22,260 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:03:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227488 states. [2020-12-23 10:03:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227488 to 220286. [2020-12-23 10:03:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220286 states. [2020-12-23 10:03:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220286 states to 220286 states and 338608 transitions. [2020-12-23 10:03:31,902 INFO L78 Accepts]: Start accepts. Automaton has 220286 states and 338608 transitions. Word has length 82 [2020-12-23 10:03:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:31,903 INFO L481 AbstractCegarLoop]: Abstraction has 220286 states and 338608 transitions. [2020-12-23 10:03:31,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 220286 states and 338608 transitions. [2020-12-23 10:03:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 10:03:31,905 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:31,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:31,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 10:03:31,905 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:31,906 INFO L82 PathProgramCache]: Analyzing trace with hash -565045271, now seen corresponding path program 1 times [2020-12-23 10:03:31,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:31,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533272832] [2020-12-23 10:03:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:31,946 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 10:03:31,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533272832] [2020-12-23 10:03:31,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:31,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:31,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081206241] [2020-12-23 10:03:31,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:31,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:31,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:31,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:31,948 INFO L87 Difference]: Start difference. First operand 220286 states and 338608 transitions. Second operand 3 states. [2020-12-23 10:03:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:47,113 INFO L93 Difference]: Finished difference Result 660434 states and 1015278 transitions. [2020-12-23 10:03:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:47,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 10:03:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:48,298 INFO L225 Difference]: With dead ends: 660434 [2020-12-23 10:03:48,299 INFO L226 Difference]: Without dead ends: 440480 [2020-12-23 10:03:48,572 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:03:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440480 states. [2020-12-23 10:03:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440480 to 220294. [2020-12-23 10:03:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220294 states. [2020-12-23 10:04:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220294 states to 220294 states and 338616 transitions. [2020-12-23 10:04:00,768 INFO L78 Accepts]: Start accepts. Automaton has 220294 states and 338616 transitions. Word has length 82 [2020-12-23 10:04:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:00,768 INFO L481 AbstractCegarLoop]: Abstraction has 220294 states and 338616 transitions. [2020-12-23 10:04:00,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 220294 states and 338616 transitions. [2020-12-23 10:04:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 10:04:00,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:00,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:00,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 10:04:00,785 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1283476260, now seen corresponding path program 1 times [2020-12-23 10:04:00,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:00,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899377883] [2020-12-23 10:04:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:01,001 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 10:04:01,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899377883] [2020-12-23 10:04:01,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:01,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:04:01,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447923604] [2020-12-23 10:04:01,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:04:01,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:04:01,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:04:01,006 INFO L87 Difference]: Start difference. First operand 220294 states and 338616 transitions. Second operand 5 states. [2020-12-23 10:04:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:18,316 INFO L93 Difference]: Finished difference Result 622528 states and 956257 transitions. [2020-12-23 10:04:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:04:18,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-23 10:04:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:19,488 INFO L225 Difference]: With dead ends: 622528 [2020-12-23 10:04:19,488 INFO L226 Difference]: Without dead ends: 402322 [2020-12-23 10:04:19,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:04:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402322 states. [2020-12-23 10:04:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402322 to 402320. [2020-12-23 10:04:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402320 states. [2020-12-23 10:04:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402320 states to 402320 states and 612785 transitions. [2020-12-23 10:04:39,470 INFO L78 Accepts]: Start accepts. Automaton has 402320 states and 612785 transitions. Word has length 83 [2020-12-23 10:04:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:39,470 INFO L481 AbstractCegarLoop]: Abstraction has 402320 states and 612785 transitions. [2020-12-23 10:04:39,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:04:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 402320 states and 612785 transitions. [2020-12-23 10:04:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 10:04:39,473 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:39,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:39,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 10:04:39,474 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2141300343, now seen corresponding path program 1 times [2020-12-23 10:04:39,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:39,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863506219] [2020-12-23 10:04:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:39,610 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 10:04:39,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863506219] [2020-12-23 10:04:39,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:39,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:04:39,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039971849] [2020-12-23 10:04:39,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:04:39,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:04:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:04:39,620 INFO L87 Difference]: Start difference. First operand 402320 states and 612785 transitions. Second operand 4 states. [2020-12-23 10:04:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:54,416 INFO L93 Difference]: Finished difference Result 715506 states and 1087835 transitions. [2020-12-23 10:04:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:04:54,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-23 10:04:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:55,129 INFO L225 Difference]: With dead ends: 715506 [2020-12-23 10:04:55,129 INFO L226 Difference]: Without dead ends: 313260 [2020-12-23 10:04:55,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:04:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313260 states. [2020-12-23 10:05:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313260 to 313260. [2020-12-23 10:05:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313260 states. [2020-12-23 10:05:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313260 states to 313260 states and 475153 transitions. [2020-12-23 10:05:11,165 INFO L78 Accepts]: Start accepts. Automaton has 313260 states and 475153 transitions. Word has length 83 [2020-12-23 10:05:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:11,165 INFO L481 AbstractCegarLoop]: Abstraction has 313260 states and 475153 transitions. [2020-12-23 10:05:11,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:05:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 313260 states and 475153 transitions. [2020-12-23 10:05:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 10:05:11,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:11,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:05:11,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 10:05:11,176 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:11,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1610663161, now seen corresponding path program 1 times [2020-12-23 10:05:11,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:11,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267426064] [2020-12-23 10:05:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:11,294 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 10:05:11,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267426064] [2020-12-23 10:05:11,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:11,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:05:11,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599244461] [2020-12-23 10:05:11,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:05:11,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:11,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:05:11,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:05:11,298 INFO L87 Difference]: Start difference. First operand 313260 states and 475153 transitions. Second operand 4 states. [2020-12-23 10:05:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:36,048 INFO L93 Difference]: Finished difference Result 823108 states and 1247342 transitions. [2020-12-23 10:05:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:05:36,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 10:05:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:37,276 INFO L225 Difference]: With dead ends: 823108 [2020-12-23 10:05:37,276 INFO L226 Difference]: Without dead ends: 509980 [2020-12-23 10:05:37,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:05:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509980 states.