/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.4.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 10:03:02,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 10:03:02,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 10:03:02,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 10:03:02,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 10:03:02,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 10:03:02,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 10:03:02,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 10:03:02,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 10:03:02,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 10:03:02,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 10:03:02,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 10:03:02,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 10:03:02,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 10:03:02,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 10:03:02,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 10:03:02,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 10:03:02,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 10:03:02,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 10:03:02,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 10:03:02,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 10:03:02,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 10:03:02,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 10:03:02,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 10:03:02,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 10:03:02,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 10:03:02,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 10:03:02,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 10:03:02,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 10:03:02,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 10:03:02,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 10:03:02,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 10:03:02,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 10:03:02,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 10:03:02,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 10:03:02,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 10:03:02,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 10:03:02,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 10:03:02,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 10:03:02,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 10:03:02,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 10:03:02,682 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:03:02,735 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 10:03:02,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 10:03:02,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 10:03:02,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 10:03:02,740 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 10:03:02,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 10:03:02,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 10:03:02,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 10:03:02,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 10:03:02,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 10:03:02,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 10:03:02,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 10:03:02,743 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 10:03:02,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 10:03:02,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 10:03:02,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 10:03:02,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 10:03:02,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:03:02,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 10:03:02,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 10:03:02,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 10:03:02,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 10:03:02,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 10:03:02,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 10:03:02,746 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 10:03:02,746 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:03:03,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 10:03:03,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 10:03:03,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 10:03:03,226 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 10:03:03,228 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 10:03:03,229 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.4.ufo.BOUNDED-6.pals.c [2020-12-23 10:03:03,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dbc4c05ce/af2929b752b844bc8154bb179dd65178/FLAG941efbe7e [2020-12-23 10:03:04,068 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 10:03:04,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-12-23 10:03:04,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dbc4c05ce/af2929b752b844bc8154bb179dd65178/FLAG941efbe7e [2020-12-23 10:03:04,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dbc4c05ce/af2929b752b844bc8154bb179dd65178 [2020-12-23 10:03:04,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 10:03:04,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 10:03:04,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 10:03:04,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 10:03:04,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 10:03:04,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:04,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5709dcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04, skipping insertion in model container [2020-12-23 10:03:04,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:04,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 10:03:04,426 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:03:04,776 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.4.ufo.BOUNDED-6.pals.c[14373,14386] [2020-12-23 10:03:04,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:03:04,802 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:03:04,945 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.4.ufo.BOUNDED-6.pals.c[14373,14386] [2020-12-23 10:03:04,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:03:04,971 INFO L208 MainTranslator]: Completed translation [2020-12-23 10:03:04,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04 WrapperNode [2020-12-23 10:03:04,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 10:03:04,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 10:03:04,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 10:03:04,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 10:03:04,985 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:03:04" (1/1) ... [2020-12-23 10:03:05,000 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:03:04" (1/1) ... [2020-12-23 10:03:05,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 10:03:05,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 10:03:05,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 10:03:05,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 10:03:05,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:05,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:05,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:05,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:05,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:05,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:05,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (1/1) ... [2020-12-23 10:03:05,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 10:03:05,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 10:03:05,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 10:03:05,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 10:03:05,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (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:03:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 10:03:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 10:03:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 10:03:05,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 10:03:06,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 10:03:06,248 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-23 10:03:06,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:03:06 BoogieIcfgContainer [2020-12-23 10:03:06,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 10:03:06,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 10:03:06,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 10:03:06,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 10:03:06,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:03:04" (1/3) ... [2020-12-23 10:03:06,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ffeecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:03:06, skipping insertion in model container [2020-12-23 10:03:06,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:04" (2/3) ... [2020-12-23 10:03:06,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ffeecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:03:06, skipping insertion in model container [2020-12-23 10:03:06,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:03:06" (3/3) ... [2020-12-23 10:03:06,262 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-12-23 10:03:06,270 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 10:03:06,276 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 10:03:06,299 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 10:03:06,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 10:03:06,329 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 10:03:06,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 10:03:06,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 10:03:06,330 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 10:03:06,330 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 10:03:06,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 10:03:06,331 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 10:03:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-12-23 10:03:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:03:06,369 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:06,373 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:03:06,373 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1418405445, now seen corresponding path program 1 times [2020-12-23 10:03:06,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:06,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798870789] [2020-12-23 10:03:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:06,813 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:06,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798870789] [2020-12-23 10:03:06,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:06,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 10:03:06,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840011600] [2020-12-23 10:03:06,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 10:03:06,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:06,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 10:03:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:03:06,844 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 2 states. [2020-12-23 10:03:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:06,918 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2020-12-23 10:03:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 10:03:06,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-12-23 10:03:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:06,954 INFO L225 Difference]: With dead ends: 227 [2020-12-23 10:03:06,961 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 10:03:06,966 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:03:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 10:03:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-23 10:03:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-23 10:03:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2020-12-23 10:03:07,046 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 37 [2020-12-23 10:03:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:07,047 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2020-12-23 10:03:07,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 10:03:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2020-12-23 10:03:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:03:07,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:07,057 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:03:07,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 10:03:07,058 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2058913401, now seen corresponding path program 1 times [2020-12-23 10:03:07,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:07,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896504431] [2020-12-23 10:03:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:07,259 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:07,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896504431] [2020-12-23 10:03:07,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:07,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:03:07,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862518509] [2020-12-23 10:03:07,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:03:07,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:07,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:03:07,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:07,266 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand 5 states. [2020-12-23 10:03:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:07,394 INFO L93 Difference]: Finished difference Result 222 states and 378 transitions. [2020-12-23 10:03:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 10:03:07,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 10:03:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:07,397 INFO L225 Difference]: With dead ends: 222 [2020-12-23 10:03:07,397 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 10:03:07,398 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:03:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 10:03:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-23 10:03:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-23 10:03:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2020-12-23 10:03:07,409 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 37 [2020-12-23 10:03:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:07,409 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2020-12-23 10:03:07,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:03:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2020-12-23 10:03:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 10:03:07,411 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:07,412 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:03:07,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 10:03:07,412 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash -415118785, now seen corresponding path program 1 times [2020-12-23 10:03:07,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:07,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416147850] [2020-12-23 10:03:07,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:07,555 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:07,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416147850] [2020-12-23 10:03:07,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:07,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:07,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182281184] [2020-12-23 10:03:07,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:07,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:07,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:07,558 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand 3 states. [2020-12-23 10:03:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:07,612 INFO L93 Difference]: Finished difference Result 279 states and 445 transitions. [2020-12-23 10:03:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:07,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 10:03:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:07,615 INFO L225 Difference]: With dead ends: 279 [2020-12-23 10:03:07,615 INFO L226 Difference]: Without dead ends: 200 [2020-12-23 10:03:07,616 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:03:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-23 10:03:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2020-12-23 10:03:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-12-23 10:03:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2020-12-23 10:03:07,631 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 66 [2020-12-23 10:03:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:07,632 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2020-12-23 10:03:07,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2020-12-23 10:03:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 10:03:07,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:07,634 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:03:07,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 10:03:07,635 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:07,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:07,636 INFO L82 PathProgramCache]: Analyzing trace with hash 928134868, now seen corresponding path program 1 times [2020-12-23 10:03:07,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:07,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513760668] [2020-12-23 10:03:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:07,747 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:07,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513760668] [2020-12-23 10:03:07,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:07,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:07,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537561328] [2020-12-23 10:03:07,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:07,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:07,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:07,754 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand 3 states. [2020-12-23 10:03:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:07,787 INFO L93 Difference]: Finished difference Result 458 states and 734 transitions. [2020-12-23 10:03:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:07,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 10:03:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:07,791 INFO L225 Difference]: With dead ends: 458 [2020-12-23 10:03:07,791 INFO L226 Difference]: Without dead ends: 320 [2020-12-23 10:03:07,792 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:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-12-23 10:03:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2020-12-23 10:03:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-12-23 10:03:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 503 transitions. [2020-12-23 10:03:07,836 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 503 transitions. Word has length 68 [2020-12-23 10:03:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:07,838 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 503 transitions. [2020-12-23 10:03:07,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 503 transitions. [2020-12-23 10:03:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 10:03:07,844 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:07,845 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:03:07,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 10:03:07,845 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1295175881, now seen corresponding path program 1 times [2020-12-23 10:03:07,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:07,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008991145] [2020-12-23 10:03:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:07,932 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:07,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008991145] [2020-12-23 10:03:07,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:07,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:07,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897144094] [2020-12-23 10:03:07,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:07,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:07,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:07,939 INFO L87 Difference]: Start difference. First operand 318 states and 503 transitions. Second operand 3 states. [2020-12-23 10:03:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:08,019 INFO L93 Difference]: Finished difference Result 802 states and 1297 transitions. [2020-12-23 10:03:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:08,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-23 10:03:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:08,025 INFO L225 Difference]: With dead ends: 802 [2020-12-23 10:03:08,025 INFO L226 Difference]: Without dead ends: 544 [2020-12-23 10:03:08,028 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:03:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-12-23 10:03:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 542. [2020-12-23 10:03:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-12-23 10:03:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 867 transitions. [2020-12-23 10:03:08,081 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 867 transitions. Word has length 70 [2020-12-23 10:03:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:08,082 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 867 transitions. [2020-12-23 10:03:08,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 867 transitions. [2020-12-23 10:03:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 10:03:08,086 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:08,087 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:03:08,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 10:03:08,090 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -367652834, now seen corresponding path program 1 times [2020-12-23 10:03:08,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:08,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84942079] [2020-12-23 10:03:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:08,301 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:08,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84942079] [2020-12-23 10:03:08,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:08,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:03:08,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958421370] [2020-12-23 10:03:08,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:03:08,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:08,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:03:08,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:08,307 INFO L87 Difference]: Start difference. First operand 542 states and 867 transitions. Second operand 5 states. [2020-12-23 10:03:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:08,579 INFO L93 Difference]: Finished difference Result 2472 states and 4044 transitions. [2020-12-23 10:03:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:03:08,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-23 10:03:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:08,593 INFO L225 Difference]: With dead ends: 2472 [2020-12-23 10:03:08,593 INFO L226 Difference]: Without dead ends: 1990 [2020-12-23 10:03:08,596 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:03:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2020-12-23 10:03:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1006. [2020-12-23 10:03:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2020-12-23 10:03:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1623 transitions. [2020-12-23 10:03:08,649 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1623 transitions. Word has length 72 [2020-12-23 10:03:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:08,650 INFO L481 AbstractCegarLoop]: Abstraction has 1006 states and 1623 transitions. [2020-12-23 10:03:08,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:03:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1623 transitions. [2020-12-23 10:03:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 10:03:08,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:08,654 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:03:08,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 10:03:08,654 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash -435168554, now seen corresponding path program 1 times [2020-12-23 10:03:08,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:08,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059059573] [2020-12-23 10:03:08,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:08,794 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:08,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059059573] [2020-12-23 10:03:08,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:08,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:08,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882508887] [2020-12-23 10:03:08,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:08,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:08,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:08,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:08,798 INFO L87 Difference]: Start difference. First operand 1006 states and 1623 transitions. Second operand 4 states. [2020-12-23 10:03:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:08,993 INFO L93 Difference]: Finished difference Result 3644 states and 5934 transitions. [2020-12-23 10:03:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:08,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-12-23 10:03:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:09,010 INFO L225 Difference]: With dead ends: 3644 [2020-12-23 10:03:09,010 INFO L226 Difference]: Without dead ends: 2698 [2020-12-23 10:03:09,014 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:03:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2020-12-23 10:03:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 1843. [2020-12-23 10:03:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2020-12-23 10:03:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2977 transitions. [2020-12-23 10:03:09,096 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2977 transitions. Word has length 73 [2020-12-23 10:03:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:09,097 INFO L481 AbstractCegarLoop]: Abstraction has 1843 states and 2977 transitions. [2020-12-23 10:03:09,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2977 transitions. [2020-12-23 10:03:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:03:09,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:09,100 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:03:09,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 10:03:09,100 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash 152415701, now seen corresponding path program 1 times [2020-12-23 10:03:09,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:09,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531539463] [2020-12-23 10:03:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:09,175 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:09,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531539463] [2020-12-23 10:03:09,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:09,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:09,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781216093] [2020-12-23 10:03:09,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:09,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:09,180 INFO L87 Difference]: Start difference. First operand 1843 states and 2977 transitions. Second operand 3 states. [2020-12-23 10:03:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:09,274 INFO L93 Difference]: Finished difference Result 3597 states and 5826 transitions. [2020-12-23 10:03:09,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:09,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:03:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:09,288 INFO L225 Difference]: With dead ends: 3597 [2020-12-23 10:03:09,288 INFO L226 Difference]: Without dead ends: 2591 [2020-12-23 10:03:09,291 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:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2020-12-23 10:03:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2020-12-23 10:03:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2589 states. [2020-12-23 10:03:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4156 transitions. [2020-12-23 10:03:09,424 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4156 transitions. Word has length 74 [2020-12-23 10:03:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:09,425 INFO L481 AbstractCegarLoop]: Abstraction has 2589 states and 4156 transitions. [2020-12-23 10:03:09,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4156 transitions. [2020-12-23 10:03:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:03:09,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:09,426 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:03:09,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 10:03:09,427 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1935815765, now seen corresponding path program 1 times [2020-12-23 10:03:09,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:09,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603161643] [2020-12-23 10:03:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:09,500 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:09,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603161643] [2020-12-23 10:03:09,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:09,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:09,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655136552] [2020-12-23 10:03:09,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:09,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:09,509 INFO L87 Difference]: Start difference. First operand 2589 states and 4156 transitions. Second operand 4 states. [2020-12-23 10:03:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:09,772 INFO L93 Difference]: Finished difference Result 8144 states and 13137 transitions. [2020-12-23 10:03:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:09,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 10:03:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:09,801 INFO L225 Difference]: With dead ends: 8144 [2020-12-23 10:03:09,801 INFO L226 Difference]: Without dead ends: 5645 [2020-12-23 10:03:09,808 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:03:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5645 states. [2020-12-23 10:03:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5645 to 4101. [2020-12-23 10:03:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2020-12-23 10:03:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6558 transitions. [2020-12-23 10:03:10,044 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6558 transitions. Word has length 74 [2020-12-23 10:03:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:10,044 INFO L481 AbstractCegarLoop]: Abstraction has 4101 states and 6558 transitions. [2020-12-23 10:03:10,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6558 transitions. [2020-12-23 10:03:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:03:10,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:10,046 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:03:10,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 10:03:10,047 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2130170379, now seen corresponding path program 1 times [2020-12-23 10:03:10,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:10,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662454005] [2020-12-23 10:03:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:10,130 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:10,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662454005] [2020-12-23 10:03:10,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:10,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:10,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096378482] [2020-12-23 10:03:10,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:10,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:10,137 INFO L87 Difference]: Start difference. First operand 4101 states and 6558 transitions. Second operand 3 states. [2020-12-23 10:03:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:10,398 INFO L93 Difference]: Finished difference Result 8053 states and 12892 transitions. [2020-12-23 10:03:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:10,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:03:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:10,432 INFO L225 Difference]: With dead ends: 8053 [2020-12-23 10:03:10,433 INFO L226 Difference]: Without dead ends: 5741 [2020-12-23 10:03:10,438 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:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2020-12-23 10:03:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5739. [2020-12-23 10:03:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5739 states. [2020-12-23 10:03:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 9098 transitions. [2020-12-23 10:03:10,697 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 9098 transitions. Word has length 74 [2020-12-23 10:03:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:10,698 INFO L481 AbstractCegarLoop]: Abstraction has 5739 states and 9098 transitions. [2020-12-23 10:03:10,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 9098 transitions. [2020-12-23 10:03:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:03:10,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:10,699 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:03:10,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 10:03:10,700 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash 339461557, now seen corresponding path program 1 times [2020-12-23 10:03:10,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:10,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807260142] [2020-12-23 10:03:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:10,784 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:10,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807260142] [2020-12-23 10:03:10,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:10,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:10,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624842681] [2020-12-23 10:03:10,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:10,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:10,787 INFO L87 Difference]: Start difference. First operand 5739 states and 9098 transitions. Second operand 3 states. [2020-12-23 10:03:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:11,065 INFO L93 Difference]: Finished difference Result 13696 states and 21823 transitions. [2020-12-23 10:03:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:11,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:03:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:11,118 INFO L225 Difference]: With dead ends: 13696 [2020-12-23 10:03:11,118 INFO L226 Difference]: Without dead ends: 8043 [2020-12-23 10:03:11,127 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:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8043 states. [2020-12-23 10:03:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8043 to 8041. [2020-12-23 10:03:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8041 states. [2020-12-23 10:03:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8041 states to 8041 states and 12783 transitions. [2020-12-23 10:03:11,505 INFO L78 Accepts]: Start accepts. Automaton has 8041 states and 12783 transitions. Word has length 74 [2020-12-23 10:03:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:11,505 INFO L481 AbstractCegarLoop]: Abstraction has 8041 states and 12783 transitions. [2020-12-23 10:03:11,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8041 states and 12783 transitions. [2020-12-23 10:03:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 10:03:11,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:11,507 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:03:11,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 10:03:11,507 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1704077331, now seen corresponding path program 1 times [2020-12-23 10:03:11,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:11,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426944218] [2020-12-23 10:03:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:11,636 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:11,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426944218] [2020-12-23 10:03:11,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:11,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:11,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876459726] [2020-12-23 10:03:11,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:11,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:11,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:11,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:11,639 INFO L87 Difference]: Start difference. First operand 8041 states and 12783 transitions. Second operand 4 states. [2020-12-23 10:03:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:12,272 INFO L93 Difference]: Finished difference Result 25448 states and 40536 transitions. [2020-12-23 10:03:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:12,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 10:03:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:12,316 INFO L225 Difference]: With dead ends: 25448 [2020-12-23 10:03:12,316 INFO L226 Difference]: Without dead ends: 17493 [2020-12-23 10:03:12,331 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:03:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17493 states. [2020-12-23 10:03:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17493 to 12714. [2020-12-23 10:03:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12714 states. [2020-12-23 10:03:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12714 states to 12714 states and 20070 transitions. [2020-12-23 10:03:12,921 INFO L78 Accepts]: Start accepts. Automaton has 12714 states and 20070 transitions. Word has length 75 [2020-12-23 10:03:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:12,922 INFO L481 AbstractCegarLoop]: Abstraction has 12714 states and 20070 transitions. [2020-12-23 10:03:12,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 12714 states and 20070 transitions. [2020-12-23 10:03:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 10:03:12,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:12,923 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:03:12,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 10:03:12,984 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash 931672261, now seen corresponding path program 1 times [2020-12-23 10:03:12,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:12,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144236772] [2020-12-23 10:03:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:13,149 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,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144236772] [2020-12-23 10:03:13,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:13,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:13,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106537450] [2020-12-23 10:03:13,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:13,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:13,151 INFO L87 Difference]: Start difference. First operand 12714 states and 20070 transitions. Second operand 4 states. [2020-12-23 10:03:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:14,380 INFO L93 Difference]: Finished difference Result 37740 states and 59503 transitions. [2020-12-23 10:03:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:14,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 10:03:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:14,450 INFO L225 Difference]: With dead ends: 37740 [2020-12-23 10:03:14,450 INFO L226 Difference]: Without dead ends: 25035 [2020-12-23 10:03:14,468 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:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25035 states. [2020-12-23 10:03:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25035 to 25033. [2020-12-23 10:03:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25033 states. [2020-12-23 10:03:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25033 states to 25033 states and 39242 transitions. [2020-12-23 10:03:16,028 INFO L78 Accepts]: Start accepts. Automaton has 25033 states and 39242 transitions. Word has length 77 [2020-12-23 10:03:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:16,028 INFO L481 AbstractCegarLoop]: Abstraction has 25033 states and 39242 transitions. [2020-12-23 10:03:16,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 25033 states and 39242 transitions. [2020-12-23 10:03:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 10:03:16,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:16,031 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:03:16,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 10:03:16,032 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1466579386, now seen corresponding path program 1 times [2020-12-23 10:03:16,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:16,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133052963] [2020-12-23 10:03:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:16,093 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:16,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133052963] [2020-12-23 10:03:16,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:16,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:16,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283355423] [2020-12-23 10:03:16,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:16,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:16,096 INFO L87 Difference]: Start difference. First operand 25033 states and 39242 transitions. Second operand 3 states. [2020-12-23 10:03:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:17,443 INFO L93 Difference]: Finished difference Result 58583 states and 91632 transitions. [2020-12-23 10:03:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:17,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 10:03:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:17,542 INFO L225 Difference]: With dead ends: 58583 [2020-12-23 10:03:17,542 INFO L226 Difference]: Without dead ends: 33679 [2020-12-23 10:03:17,584 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:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33679 states. [2020-12-23 10:03:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33679 to 32767. [2020-12-23 10:03:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32767 states. [2020-12-23 10:03:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32767 states to 32767 states and 50640 transitions. [2020-12-23 10:03:19,231 INFO L78 Accepts]: Start accepts. Automaton has 32767 states and 50640 transitions. Word has length 78 [2020-12-23 10:03:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:19,231 INFO L481 AbstractCegarLoop]: Abstraction has 32767 states and 50640 transitions. [2020-12-23 10:03:19,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32767 states and 50640 transitions. [2020-12-23 10:03:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 10:03:19,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 10:03:19,233 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 295226641, now seen corresponding path program 1 times [2020-12-23 10:03:19,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:19,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538076445] [2020-12-23 10:03:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:19,268 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:19,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538076445] [2020-12-23 10:03:19,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:19,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:19,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069867952] [2020-12-23 10:03:19,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:19,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:19,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:19,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:19,273 INFO L87 Difference]: Start difference. First operand 32767 states and 50640 transitions. Second operand 3 states. [2020-12-23 10:03:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:21,578 INFO L93 Difference]: Finished difference Result 98263 states and 151858 transitions. [2020-12-23 10:03:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:21,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 10:03:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:21,785 INFO L225 Difference]: With dead ends: 98263 [2020-12-23 10:03:21,785 INFO L226 Difference]: Without dead ends: 65524 [2020-12-23 10:03:21,822 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:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65524 states. [2020-12-23 10:03:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65524 to 32769. [2020-12-23 10:03:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32769 states. [2020-12-23 10:03:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32769 states to 32769 states and 50642 transitions. [2020-12-23 10:03:23,588 INFO L78 Accepts]: Start accepts. Automaton has 32769 states and 50642 transitions. Word has length 78 [2020-12-23 10:03:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:23,588 INFO L481 AbstractCegarLoop]: Abstraction has 32769 states and 50642 transitions. [2020-12-23 10:03:23,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 32769 states and 50642 transitions. [2020-12-23 10:03:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 10:03:23,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:23,589 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:03:23,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:03:23,590 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash -57061967, now seen corresponding path program 1 times [2020-12-23 10:03:23,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:23,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575602443] [2020-12-23 10:03:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:23,698 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:23,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575602443] [2020-12-23 10:03:23,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:23,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:23,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020285706] [2020-12-23 10:03:23,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:23,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:23,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:23,703 INFO L87 Difference]: Start difference. First operand 32769 states and 50642 transitions. Second operand 4 states. [2020-12-23 10:03:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:26,123 INFO L93 Difference]: Finished difference Result 96769 states and 149304 transitions. [2020-12-23 10:03:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:26,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 10:03:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:26,268 INFO L225 Difference]: With dead ends: 96769 [2020-12-23 10:03:26,268 INFO L226 Difference]: Without dead ends: 64030 [2020-12-23 10:03:26,300 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:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64030 states. [2020-12-23 10:03:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64030 to 64028. [2020-12-23 10:03:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64028 states. [2020-12-23 10:03:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64028 states to 64028 states and 98090 transitions. [2020-12-23 10:03:28,747 INFO L78 Accepts]: Start accepts. Automaton has 64028 states and 98090 transitions. Word has length 79 [2020-12-23 10:03:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:28,747 INFO L481 AbstractCegarLoop]: Abstraction has 64028 states and 98090 transitions. [2020-12-23 10:03:28,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 64028 states and 98090 transitions. [2020-12-23 10:03:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 10:03:28,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:28,749 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:03:28,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:03:28,749 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1163177193, now seen corresponding path program 1 times [2020-12-23 10:03:28,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:28,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899087485] [2020-12-23 10:03:28,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:29,021 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:29,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899087485] [2020-12-23 10:03:29,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:29,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:29,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507792988] [2020-12-23 10:03:29,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:29,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:29,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:29,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:29,027 INFO L87 Difference]: Start difference. First operand 64028 states and 98090 transitions. Second operand 3 states. [2020-12-23 10:03:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:31,790 INFO L93 Difference]: Finished difference Result 154916 states and 238318 transitions. [2020-12-23 10:03:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:31,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 10:03:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:32,055 INFO L225 Difference]: With dead ends: 154916 [2020-12-23 10:03:32,056 INFO L226 Difference]: Without dead ends: 91168 [2020-12-23 10:03:32,150 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:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91168 states. [2020-12-23 10:03:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91168 to 88502. [2020-12-23 10:03:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88502 states. [2020-12-23 10:03:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88502 states to 88502 states and 134830 transitions. [2020-12-23 10:03:35,574 INFO L78 Accepts]: Start accepts. Automaton has 88502 states and 134830 transitions. Word has length 80 [2020-12-23 10:03:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:35,574 INFO L481 AbstractCegarLoop]: Abstraction has 88502 states and 134830 transitions. [2020-12-23 10:03:35,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 88502 states and 134830 transitions. [2020-12-23 10:03:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 10:03:35,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:35,581 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:03:35,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:03:35,582 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -544448643, now seen corresponding path program 1 times [2020-12-23 10:03:35,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:35,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996853331] [2020-12-23 10:03:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:35,617 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:35,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996853331] [2020-12-23 10:03:35,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:35,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:35,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375624621] [2020-12-23 10:03:35,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:35,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:35,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:35,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:35,619 INFO L87 Difference]: Start difference. First operand 88502 states and 134830 transitions. Second operand 3 states. [2020-12-23 10:03:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:41,204 INFO L93 Difference]: Finished difference Result 265430 states and 404370 transitions. [2020-12-23 10:03:41,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:41,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 10:03:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:41,535 INFO L225 Difference]: With dead ends: 265430 [2020-12-23 10:03:41,535 INFO L226 Difference]: Without dead ends: 176972 [2020-12-23 10:03:41,610 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:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176972 states. [2020-12-23 10:03:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176972 to 88506. [2020-12-23 10:03:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88506 states. [2020-12-23 10:03:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88506 states to 88506 states and 134834 transitions. [2020-12-23 10:03:45,824 INFO L78 Accepts]: Start accepts. Automaton has 88506 states and 134834 transitions. Word has length 80 [2020-12-23 10:03:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:45,824 INFO L481 AbstractCegarLoop]: Abstraction has 88506 states and 134834 transitions. [2020-12-23 10:03:45,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 88506 states and 134834 transitions. [2020-12-23 10:03:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 10:03:45,826 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:45,826 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:45,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:03:45,826 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2051256477, now seen corresponding path program 1 times [2020-12-23 10:03:45,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:45,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785758575] [2020-12-23 10:03:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:45,917 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:45,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785758575] [2020-12-23 10:03:45,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:45,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:45,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482810768] [2020-12-23 10:03:45,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:45,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:45,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:45,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:45,919 INFO L87 Difference]: Start difference. First operand 88506 states and 134834 transitions. Second operand 4 states. [2020-12-23 10:03:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:51,736 INFO L93 Difference]: Finished difference Result 261266 states and 397258 transitions. [2020-12-23 10:03:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:51,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 10:03:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:52,216 INFO L225 Difference]: With dead ends: 261266 [2020-12-23 10:03:52,216 INFO L226 Difference]: Without dead ends: 172808 [2020-12-23 10:03:52,271 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:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172808 states. [2020-12-23 10:03:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172808 to 172806. [2020-12-23 10:03:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172806 states. [2020-12-23 10:03:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172806 states to 172806 states and 260760 transitions. [2020-12-23 10:03:59,396 INFO L78 Accepts]: Start accepts. Automaton has 172806 states and 260760 transitions. Word has length 81 [2020-12-23 10:03:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:59,396 INFO L481 AbstractCegarLoop]: Abstraction has 172806 states and 260760 transitions. [2020-12-23 10:03:59,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 172806 states and 260760 transitions. [2020-12-23 10:03:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 10:03:59,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:59,399 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:59,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:03:59,399 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2106822348, now seen corresponding path program 1 times [2020-12-23 10:03:59,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:59,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399300010] [2020-12-23 10:03:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:59,459 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:59,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399300010] [2020-12-23 10:03:59,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:59,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:59,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512065777] [2020-12-23 10:03:59,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:59,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:59,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:59,461 INFO L87 Difference]: Start difference. First operand 172806 states and 260760 transitions. Second operand 3 states. [2020-12-23 10:04:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:08,317 INFO L93 Difference]: Finished difference Result 418970 states and 635738 transitions. [2020-12-23 10:04:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:08,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 10:04:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:08,838 INFO L225 Difference]: With dead ends: 418970 [2020-12-23 10:04:08,838 INFO L226 Difference]: Without dead ends: 246728 [2020-12-23 10:04:08,972 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:04:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246728 states. [2020-12-23 10:04:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246728 to 238406. [2020-12-23 10:04:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238406 states. [2020-12-23 10:04:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238406 states to 238406 states and 357016 transitions. [2020-12-23 10:04:19,733 INFO L78 Accepts]: Start accepts. Automaton has 238406 states and 357016 transitions. Word has length 82 [2020-12-23 10:04:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:19,733 INFO L481 AbstractCegarLoop]: Abstraction has 238406 states and 357016 transitions. [2020-12-23 10:04:19,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 238406 states and 357016 transitions. [2020-12-23 10:04:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 10:04:19,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:19,736 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:04:19,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 10:04:19,737 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash -565045271, now seen corresponding path program 1 times [2020-12-23 10:04:19,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:19,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049813293] [2020-12-23 10:04:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:19,793 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:19,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049813293] [2020-12-23 10:04:19,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:19,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:19,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20962729] [2020-12-23 10:04:19,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:19,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:19,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:19,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:19,795 INFO L87 Difference]: Start difference. First operand 238406 states and 357016 transitions. Second operand 3 states. [2020-12-23 10:04:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:36,598 INFO L93 Difference]: Finished difference Result 714794 states and 1070502 transitions. [2020-12-23 10:04:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:36,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 10:04:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:37,614 INFO L225 Difference]: With dead ends: 714794 [2020-12-23 10:04:37,614 INFO L226 Difference]: Without dead ends: 476720 [2020-12-23 10:04:38,129 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:04:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476720 states. [2020-12-23 10:04:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476720 to 238414. [2020-12-23 10:04:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238414 states. [2020-12-23 10:04:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238414 states to 238414 states and 357024 transitions. [2020-12-23 10:04:52,333 INFO L78 Accepts]: Start accepts. Automaton has 238414 states and 357024 transitions. Word has length 82 [2020-12-23 10:04:52,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:52,334 INFO L481 AbstractCegarLoop]: Abstraction has 238414 states and 357024 transitions. [2020-12-23 10:04:52,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 238414 states and 357024 transitions. [2020-12-23 10:04:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 10:04:52,338 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:52,338 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:52,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 10:04:52,339 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1283476260, now seen corresponding path program 1 times [2020-12-23 10:04:52,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:52,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50661617] [2020-12-23 10:04:52,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:52,534 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:52,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50661617] [2020-12-23 10:04:52,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:52,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:04:52,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643842583] [2020-12-23 10:04:52,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:04:52,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:04:52,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:04:52,540 INFO L87 Difference]: Start difference. First operand 238414 states and 357024 transitions. Second operand 5 states. [2020-12-23 10:05:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:12,387 INFO L93 Difference]: Finished difference Result 673280 states and 1007209 transitions. [2020-12-23 10:05:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:05:12,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-23 10:05:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:13,603 INFO L225 Difference]: With dead ends: 673280 [2020-12-23 10:05:13,603 INFO L226 Difference]: Without dead ends: 434954 [2020-12-23 10:05:13,896 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:05:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434954 states. [2020-12-23 10:05:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434954 to 434952. [2020-12-23 10:05:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434952 states. [2020-12-23 10:05:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434952 states to 434952 states and 644545 transitions. [2020-12-23 10:05:35,168 INFO L78 Accepts]: Start accepts. Automaton has 434952 states and 644545 transitions. Word has length 83 [2020-12-23 10:05:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:35,169 INFO L481 AbstractCegarLoop]: Abstraction has 434952 states and 644545 transitions. [2020-12-23 10:05:35,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:05:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 434952 states and 644545 transitions. [2020-12-23 10:05:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 10:05:35,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:35,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:05:35,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 10:05:35,173 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2141300343, now seen corresponding path program 1 times [2020-12-23 10:05:35,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:35,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347480951] [2020-12-23 10:05:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:35,335 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:35,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347480951] [2020-12-23 10:05:35,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:35,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:05:35,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816651215] [2020-12-23 10:05:35,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:05:35,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:35,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:05:35,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:05:35,342 INFO L87 Difference]: Start difference. First operand 434952 states and 644545 transitions. Second operand 4 states.