/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:18:37,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:18:37,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:18:37,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:18:37,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:18:37,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:18:37,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:18:37,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:18:37,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:18:37,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:18:37,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:18:37,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:18:37,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:18:37,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:18:37,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:18:37,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:18:37,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:18:37,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:18:37,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:18:37,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:18:37,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:18:37,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:18:37,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:18:37,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:18:37,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:18:37,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:18:37,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:18:37,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:18:37,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:18:37,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:18:37,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:18:37,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:18:37,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:18:37,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:18:37,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:18:37,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:18:37,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:18:37,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:18:37,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:18:37,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:18:37,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:18:37,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 20:18:37,353 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:18:37,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:18:37,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:18:37,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:18:37,358 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:18:37,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:18:37,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:18:37,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:18:37,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:18:37,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:18:37,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:18:37,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:18:37,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:18:37,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:18:37,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:18:37,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:18:37,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:18:37,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:18:37,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:18:37,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:18:37,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:18:37,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:18:37,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:18:37,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:18:37,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:18:37,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 20:18:37,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:18:37,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:18:37,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:18:37,845 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:18:37,846 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:18:37,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 20:18:37,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac865c87a/5b631d0ca01248f39467a8e42935f189/FLAG65195e40d [2021-01-06 20:18:38,838 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:18:38,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 20:18:38,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac865c87a/5b631d0ca01248f39467a8e42935f189/FLAG65195e40d [2021-01-06 20:18:39,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac865c87a/5b631d0ca01248f39467a8e42935f189 [2021-01-06 20:18:39,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:18:39,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:18:39,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:18:39,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:18:39,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:18:39,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e14b840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39, skipping insertion in model container [2021-01-06 20:18:39,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:18:39,178 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~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[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1766~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,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[~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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] 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[~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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] 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[~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[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] 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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1897~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:18:39,451 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6777,6790] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] 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[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] 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[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] 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[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:18:39,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:18:39,506 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~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[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1766~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,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[~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[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] 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[~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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] 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[~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[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] 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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1897~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:18:39,569 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6777,6790] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] 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[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] 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[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] 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[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 20:18:39,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:18:39,639 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:18:39,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39 WrapperNode [2021-01-06 20:18:39,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:18:39,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:18:39,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:18:39,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:18:39,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:18:39,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:18:39,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:18:39,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:18:39,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... [2021-01-06 20:18:39,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:18:39,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:18:39,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:18:39,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:18:39,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:18:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:18:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:18:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:18:39,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:18:41,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:18:41,068 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:18:41,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:18:41 BoogieIcfgContainer [2021-01-06 20:18:41,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:18:41,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:18:41,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:18:41,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:18:41,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:18:39" (1/3) ... [2021-01-06 20:18:41,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28281805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:18:41, skipping insertion in model container [2021-01-06 20:18:41,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:18:39" (2/3) ... [2021-01-06 20:18:41,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28281805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:18:41, skipping insertion in model container [2021-01-06 20:18:41,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:18:41" (3/3) ... [2021-01-06 20:18:41,086 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 20:18:41,094 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:18:41,102 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 20:18:41,130 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 20:18:41,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:18:41,177 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:18:41,177 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:18:41,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:18:41,177 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:18:41,177 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:18:41,177 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:18:41,178 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:18:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2021-01-06 20:18:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 20:18:41,221 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:41,222 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] [2021-01-06 20:18:41,222 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash -278043806, now seen corresponding path program 1 times [2021-01-06 20:18:41,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:41,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100259289] [2021-01-06 20:18:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:41,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100259289] [2021-01-06 20:18:41,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:41,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:41,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826404100] [2021-01-06 20:18:41,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:41,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:41,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:41,726 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 3 states. [2021-01-06 20:18:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:41,895 INFO L93 Difference]: Finished difference Result 297 states and 500 transitions. [2021-01-06 20:18:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:41,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2021-01-06 20:18:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:41,932 INFO L225 Difference]: With dead ends: 297 [2021-01-06 20:18:41,933 INFO L226 Difference]: Without dead ends: 205 [2021-01-06 20:18:41,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-01-06 20:18:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2021-01-06 20:18:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2021-01-06 20:18:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 321 transitions. [2021-01-06 20:18:42,074 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 321 transitions. Word has length 50 [2021-01-06 20:18:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:42,075 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 321 transitions. [2021-01-06 20:18:42,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 321 transitions. [2021-01-06 20:18:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 20:18:42,085 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:42,086 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] [2021-01-06 20:18:42,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:18:42,086 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:42,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847823, now seen corresponding path program 1 times [2021-01-06 20:18:42,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:42,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613923462] [2021-01-06 20:18:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:42,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613923462] [2021-01-06 20:18:42,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:42,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:42,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994162153] [2021-01-06 20:18:42,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:42,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:42,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:42,238 INFO L87 Difference]: Start difference. First operand 202 states and 321 transitions. Second operand 3 states. [2021-01-06 20:18:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:42,339 INFO L93 Difference]: Finished difference Result 496 states and 805 transitions. [2021-01-06 20:18:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:42,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-06 20:18:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:42,344 INFO L225 Difference]: With dead ends: 496 [2021-01-06 20:18:42,346 INFO L226 Difference]: Without dead ends: 342 [2021-01-06 20:18:42,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-06 20:18:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2021-01-06 20:18:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2021-01-06 20:18:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 543 transitions. [2021-01-06 20:18:42,405 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 543 transitions. Word has length 52 [2021-01-06 20:18:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:42,406 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 543 transitions. [2021-01-06 20:18:42,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 543 transitions. [2021-01-06 20:18:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 20:18:42,408 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:42,409 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] [2021-01-06 20:18:42,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:18:42,409 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash 329846722, now seen corresponding path program 1 times [2021-01-06 20:18:42,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:42,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610962748] [2021-01-06 20:18:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:42,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610962748] [2021-01-06 20:18:42,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:42,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:42,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707837880] [2021-01-06 20:18:42,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:42,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:42,558 INFO L87 Difference]: Start difference. First operand 338 states and 543 transitions. Second operand 3 states. [2021-01-06 20:18:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:42,626 INFO L93 Difference]: Finished difference Result 890 states and 1445 transitions. [2021-01-06 20:18:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:42,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-06 20:18:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:42,631 INFO L225 Difference]: With dead ends: 890 [2021-01-06 20:18:42,631 INFO L226 Difference]: Without dead ends: 600 [2021-01-06 20:18:42,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-01-06 20:18:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 594. [2021-01-06 20:18:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-01-06 20:18:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 955 transitions. [2021-01-06 20:18:42,700 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 955 transitions. Word has length 54 [2021-01-06 20:18:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:42,709 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 955 transitions. [2021-01-06 20:18:42,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 955 transitions. [2021-01-06 20:18:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 20:18:42,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:42,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:18:42,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:18:42,717 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1296814383, now seen corresponding path program 1 times [2021-01-06 20:18:42,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:42,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568960348] [2021-01-06 20:18:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:43,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568960348] [2021-01-06 20:18:43,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:43,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:18:43,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640768575] [2021-01-06 20:18:43,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:18:43,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:18:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:18:43,005 INFO L87 Difference]: Start difference. First operand 594 states and 955 transitions. Second operand 5 states. [2021-01-06 20:18:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:43,316 INFO L93 Difference]: Finished difference Result 2292 states and 3764 transitions. [2021-01-06 20:18:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 20:18:43,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2021-01-06 20:18:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:43,327 INFO L225 Difference]: With dead ends: 2292 [2021-01-06 20:18:43,328 INFO L226 Difference]: Without dead ends: 1746 [2021-01-06 20:18:43,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:18:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2021-01-06 20:18:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1071. [2021-01-06 20:18:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2021-01-06 20:18:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1733 transitions. [2021-01-06 20:18:43,418 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1733 transitions. Word has length 56 [2021-01-06 20:18:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:43,419 INFO L481 AbstractCegarLoop]: Abstraction has 1071 states and 1733 transitions. [2021-01-06 20:18:43,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:18:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1733 transitions. [2021-01-06 20:18:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 20:18:43,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:43,421 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] [2021-01-06 20:18:43,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:18:43,421 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1484036003, now seen corresponding path program 1 times [2021-01-06 20:18:43,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:43,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433911304] [2021-01-06 20:18:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:43,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433911304] [2021-01-06 20:18:43,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:43,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:43,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53775858] [2021-01-06 20:18:43,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:43,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:43,535 INFO L87 Difference]: Start difference. First operand 1071 states and 1733 transitions. Second operand 4 states. [2021-01-06 20:18:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:43,785 INFO L93 Difference]: Finished difference Result 3136 states and 5140 transitions. [2021-01-06 20:18:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:43,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 20:18:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:43,822 INFO L225 Difference]: With dead ends: 3136 [2021-01-06 20:18:43,822 INFO L226 Difference]: Without dead ends: 2113 [2021-01-06 20:18:43,824 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 [2021-01-06 20:18:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2021-01-06 20:18:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1583. [2021-01-06 20:18:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2021-01-06 20:18:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2574 transitions. [2021-01-06 20:18:43,962 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2574 transitions. Word has length 57 [2021-01-06 20:18:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:43,963 INFO L481 AbstractCegarLoop]: Abstraction has 1583 states and 2574 transitions. [2021-01-06 20:18:43,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2574 transitions. [2021-01-06 20:18:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 20:18:43,965 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:43,965 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] [2021-01-06 20:18:43,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:18:43,965 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1297470346, now seen corresponding path program 1 times [2021-01-06 20:18:43,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:43,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392479985] [2021-01-06 20:18:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:44,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392479985] [2021-01-06 20:18:44,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:44,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:44,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112684670] [2021-01-06 20:18:44,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:44,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:44,092 INFO L87 Difference]: Start difference. First operand 1583 states and 2574 transitions. Second operand 4 states. [2021-01-06 20:18:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:44,443 INFO L93 Difference]: Finished difference Result 4604 states and 7538 transitions. [2021-01-06 20:18:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:44,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-01-06 20:18:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:44,463 INFO L225 Difference]: With dead ends: 4604 [2021-01-06 20:18:44,463 INFO L226 Difference]: Without dead ends: 3069 [2021-01-06 20:18:44,466 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 [2021-01-06 20:18:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2021-01-06 20:18:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2314. [2021-01-06 20:18:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2021-01-06 20:18:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3761 transitions. [2021-01-06 20:18:44,685 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3761 transitions. Word has length 58 [2021-01-06 20:18:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:44,686 INFO L481 AbstractCegarLoop]: Abstraction has 2314 states and 3761 transitions. [2021-01-06 20:18:44,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3761 transitions. [2021-01-06 20:18:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:18:44,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:44,690 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] [2021-01-06 20:18:44,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:18:44,690 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash -370820470, now seen corresponding path program 1 times [2021-01-06 20:18:44,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:44,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602736311] [2021-01-06 20:18:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:44,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602736311] [2021-01-06 20:18:44,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:44,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:44,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484679324] [2021-01-06 20:18:44,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:44,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:44,797 INFO L87 Difference]: Start difference. First operand 2314 states and 3761 transitions. Second operand 3 states. [2021-01-06 20:18:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:45,111 INFO L93 Difference]: Finished difference Result 5104 states and 8336 transitions. [2021-01-06 20:18:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:45,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-06 20:18:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:45,131 INFO L225 Difference]: With dead ends: 5104 [2021-01-06 20:18:45,131 INFO L226 Difference]: Without dead ends: 3495 [2021-01-06 20:18:45,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2021-01-06 20:18:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3493. [2021-01-06 20:18:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3493 states. [2021-01-06 20:18:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 5667 transitions. [2021-01-06 20:18:45,437 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 5667 transitions. Word has length 59 [2021-01-06 20:18:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:45,437 INFO L481 AbstractCegarLoop]: Abstraction has 3493 states and 5667 transitions. [2021-01-06 20:18:45,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 5667 transitions. [2021-01-06 20:18:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:18:45,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:45,439 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] [2021-01-06 20:18:45,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:18:45,439 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1594203451, now seen corresponding path program 1 times [2021-01-06 20:18:45,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:45,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140366432] [2021-01-06 20:18:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:45,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140366432] [2021-01-06 20:18:45,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:45,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:45,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311876480] [2021-01-06 20:18:45,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:45,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:45,499 INFO L87 Difference]: Start difference. First operand 3493 states and 5667 transitions. Second operand 3 states. [2021-01-06 20:18:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:45,887 INFO L93 Difference]: Finished difference Result 6911 states and 11267 transitions. [2021-01-06 20:18:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:45,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-06 20:18:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:45,915 INFO L225 Difference]: With dead ends: 6911 [2021-01-06 20:18:45,916 INFO L226 Difference]: Without dead ends: 4911 [2021-01-06 20:18:45,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2021-01-06 20:18:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4909. [2021-01-06 20:18:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4909 states. [2021-01-06 20:18:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 7945 transitions. [2021-01-06 20:18:46,339 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 7945 transitions. Word has length 59 [2021-01-06 20:18:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:46,339 INFO L481 AbstractCegarLoop]: Abstraction has 4909 states and 7945 transitions. [2021-01-06 20:18:46,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 7945 transitions. [2021-01-06 20:18:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:18:46,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:46,340 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] [2021-01-06 20:18:46,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:18:46,341 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1620263222, now seen corresponding path program 1 times [2021-01-06 20:18:46,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:46,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271100952] [2021-01-06 20:18:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:46,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271100952] [2021-01-06 20:18:46,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:46,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:46,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817361324] [2021-01-06 20:18:46,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:46,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:46,465 INFO L87 Difference]: Start difference. First operand 4909 states and 7945 transitions. Second operand 4 states. [2021-01-06 20:18:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:47,452 INFO L93 Difference]: Finished difference Result 15774 states and 25651 transitions. [2021-01-06 20:18:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:47,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 20:18:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:47,515 INFO L225 Difference]: With dead ends: 15774 [2021-01-06 20:18:47,515 INFO L226 Difference]: Without dead ends: 10993 [2021-01-06 20:18:47,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10993 states. [2021-01-06 20:18:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10993 to 7607. [2021-01-06 20:18:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7607 states. [2021-01-06 20:18:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7607 states to 7607 states and 12283 transitions. [2021-01-06 20:18:48,370 INFO L78 Accepts]: Start accepts. Automaton has 7607 states and 12283 transitions. Word has length 59 [2021-01-06 20:18:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:48,371 INFO L481 AbstractCegarLoop]: Abstraction has 7607 states and 12283 transitions. [2021-01-06 20:18:48,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7607 states and 12283 transitions. [2021-01-06 20:18:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 20:18:48,372 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:48,372 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] [2021-01-06 20:18:48,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:18:48,373 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash -515214271, now seen corresponding path program 1 times [2021-01-06 20:18:48,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:48,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915486541] [2021-01-06 20:18:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:48,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915486541] [2021-01-06 20:18:48,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:48,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:48,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394780684] [2021-01-06 20:18:48,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:48,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:48,435 INFO L87 Difference]: Start difference. First operand 7607 states and 12283 transitions. Second operand 3 states. [2021-01-06 20:18:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:49,688 INFO L93 Difference]: Finished difference Result 16681 states and 27278 transitions. [2021-01-06 20:18:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:49,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-06 20:18:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:49,726 INFO L225 Difference]: With dead ends: 16681 [2021-01-06 20:18:49,726 INFO L226 Difference]: Without dead ends: 11156 [2021-01-06 20:18:49,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11156 states. [2021-01-06 20:18:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11156 to 11154. [2021-01-06 20:18:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11154 states. [2021-01-06 20:18:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11154 states to 11154 states and 18059 transitions. [2021-01-06 20:18:50,833 INFO L78 Accepts]: Start accepts. Automaton has 11154 states and 18059 transitions. Word has length 59 [2021-01-06 20:18:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:50,834 INFO L481 AbstractCegarLoop]: Abstraction has 11154 states and 18059 transitions. [2021-01-06 20:18:50,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:18:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11154 states and 18059 transitions. [2021-01-06 20:18:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 20:18:50,835 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:50,835 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] [2021-01-06 20:18:50,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:18:50,835 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 482860251, now seen corresponding path program 1 times [2021-01-06 20:18:50,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:50,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91539603] [2021-01-06 20:18:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:50,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91539603] [2021-01-06 20:18:50,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:50,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:18:50,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812968019] [2021-01-06 20:18:50,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:18:50,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:18:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:18:50,930 INFO L87 Difference]: Start difference. First operand 11154 states and 18059 transitions. Second operand 4 states. [2021-01-06 20:18:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:52,729 INFO L93 Difference]: Finished difference Result 32824 states and 53172 transitions. [2021-01-06 20:18:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:18:52,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 20:18:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:52,803 INFO L225 Difference]: With dead ends: 32824 [2021-01-06 20:18:52,804 INFO L226 Difference]: Without dead ends: 21679 [2021-01-06 20:18:52,826 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 [2021-01-06 20:18:52,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2021-01-06 20:18:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 21677. [2021-01-06 20:18:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21677 states. [2021-01-06 20:18:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21677 states to 21677 states and 34901 transitions. [2021-01-06 20:18:55,235 INFO L78 Accepts]: Start accepts. Automaton has 21677 states and 34901 transitions. Word has length 61 [2021-01-06 20:18:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:18:55,236 INFO L481 AbstractCegarLoop]: Abstraction has 21677 states and 34901 transitions. [2021-01-06 20:18:55,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:18:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 21677 states and 34901 transitions. [2021-01-06 20:18:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 20:18:55,237 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:18:55,237 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] [2021-01-06 20:18:55,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:18:55,237 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:18:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:18:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash 749690503, now seen corresponding path program 1 times [2021-01-06 20:18:55,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:18:55,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261520635] [2021-01-06 20:18:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:18:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:18:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:18:55,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261520635] [2021-01-06 20:18:55,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:18:55,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:18:55,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621670129] [2021-01-06 20:18:55,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:18:55,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:18:55,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:18:55,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:55,290 INFO L87 Difference]: Start difference. First operand 21677 states and 34901 transitions. Second operand 3 states. [2021-01-06 20:18:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:18:57,747 INFO L93 Difference]: Finished difference Result 64993 states and 104641 transitions. [2021-01-06 20:18:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:18:57,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 20:18:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:18:57,868 INFO L225 Difference]: With dead ends: 64993 [2021-01-06 20:18:57,869 INFO L226 Difference]: Without dead ends: 43344 [2021-01-06 20:18:57,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:18:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43344 states. [2021-01-06 20:19:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43344 to 21679. [2021-01-06 20:19:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21679 states. [2021-01-06 20:19:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21679 states to 21679 states and 34903 transitions. [2021-01-06 20:19:00,435 INFO L78 Accepts]: Start accepts. Automaton has 21679 states and 34903 transitions. Word has length 62 [2021-01-06 20:19:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:00,435 INFO L481 AbstractCegarLoop]: Abstraction has 21679 states and 34903 transitions. [2021-01-06 20:19:00,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21679 states and 34903 transitions. [2021-01-06 20:19:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:19:00,436 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:00,436 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] [2021-01-06 20:19:00,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:19:00,437 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2144025067, now seen corresponding path program 1 times [2021-01-06 20:19:00,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:00,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799249850] [2021-01-06 20:19:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:00,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799249850] [2021-01-06 20:19:00,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:00,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:00,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385051483] [2021-01-06 20:19:00,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:00,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:00,495 INFO L87 Difference]: Start difference. First operand 21679 states and 34903 transitions. Second operand 3 states. [2021-01-06 20:19:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:03,189 INFO L93 Difference]: Finished difference Result 63647 states and 102554 transitions. [2021-01-06 20:19:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:19:03,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 20:19:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:03,294 INFO L225 Difference]: With dead ends: 63647 [2021-01-06 20:19:03,294 INFO L226 Difference]: Without dead ends: 42110 [2021-01-06 20:19:03,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42110 states. [2021-01-06 20:19:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42110 to 42108. [2021-01-06 20:19:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42108 states. [2021-01-06 20:19:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42108 states to 42108 states and 67397 transitions. [2021-01-06 20:19:06,659 INFO L78 Accepts]: Start accepts. Automaton has 42108 states and 67397 transitions. Word has length 63 [2021-01-06 20:19:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:06,660 INFO L481 AbstractCegarLoop]: Abstraction has 42108 states and 67397 transitions. [2021-01-06 20:19:06,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:19:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 42108 states and 67397 transitions. [2021-01-06 20:19:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:19:06,661 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:06,662 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] [2021-01-06 20:19:06,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:19:06,662 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1309892562, now seen corresponding path program 1 times [2021-01-06 20:19:06,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:06,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520230368] [2021-01-06 20:19:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:06,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520230368] [2021-01-06 20:19:06,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:06,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:19:06,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430972729] [2021-01-06 20:19:06,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:19:06,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:19:06,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:19:06,821 INFO L87 Difference]: Start difference. First operand 42108 states and 67397 transitions. Second operand 5 states. [2021-01-06 20:19:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:12,883 INFO L93 Difference]: Finished difference Result 123662 states and 198032 transitions. [2021-01-06 20:19:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:12,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-06 20:19:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:13,068 INFO L225 Difference]: With dead ends: 123662 [2021-01-06 20:19:13,069 INFO L226 Difference]: Without dead ends: 81568 [2021-01-06 20:19:13,135 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 [2021-01-06 20:19:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81568 states. [2021-01-06 20:19:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81568 to 81566. [2021-01-06 20:19:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81566 states. [2021-01-06 20:19:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81566 states to 81566 states and 129753 transitions. [2021-01-06 20:19:19,461 INFO L78 Accepts]: Start accepts. Automaton has 81566 states and 129753 transitions. Word has length 63 [2021-01-06 20:19:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:19,461 INFO L481 AbstractCegarLoop]: Abstraction has 81566 states and 129753 transitions. [2021-01-06 20:19:19,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:19:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 81566 states and 129753 transitions. [2021-01-06 20:19:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:19:19,463 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:19,463 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] [2021-01-06 20:19:19,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:19:19,464 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash 730213818, now seen corresponding path program 1 times [2021-01-06 20:19:19,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:19,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707387542] [2021-01-06 20:19:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:19,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707387542] [2021-01-06 20:19:19,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:19,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:19:19,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392173282] [2021-01-06 20:19:19,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:19:19,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:19:19,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:19:19,561 INFO L87 Difference]: Start difference. First operand 81566 states and 129753 transitions. Second operand 4 states. [2021-01-06 20:19:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:19:31,160 INFO L93 Difference]: Finished difference Result 239625 states and 381278 transitions. [2021-01-06 20:19:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:19:31,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-01-06 20:19:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:19:31,658 INFO L225 Difference]: With dead ends: 239625 [2021-01-06 20:19:31,659 INFO L226 Difference]: Without dead ends: 158115 [2021-01-06 20:19:31,766 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 [2021-01-06 20:19:31,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158115 states. [2021-01-06 20:19:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158115 to 158113. [2021-01-06 20:19:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158113 states. [2021-01-06 20:19:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158113 states to 158113 states and 249813 transitions. [2021-01-06 20:19:44,396 INFO L78 Accepts]: Start accepts. Automaton has 158113 states and 249813 transitions. Word has length 63 [2021-01-06 20:19:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:19:44,396 INFO L481 AbstractCegarLoop]: Abstraction has 158113 states and 249813 transitions. [2021-01-06 20:19:44,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:19:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 158113 states and 249813 transitions. [2021-01-06 20:19:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:19:44,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:19:44,400 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] [2021-01-06 20:19:44,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:19:44,401 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:19:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:19:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1038687238, now seen corresponding path program 1 times [2021-01-06 20:19:44,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:19:44,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245478019] [2021-01-06 20:19:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:19:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:19:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:19:44,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245478019] [2021-01-06 20:19:44,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:19:44,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:19:44,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270212841] [2021-01-06 20:19:44,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:19:44,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:19:44,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:19:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:19:44,473 INFO L87 Difference]: Start difference. First operand 158113 states and 249813 transitions. Second operand 3 states. [2021-01-06 20:20:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:20:07,623 INFO L93 Difference]: Finished difference Result 474187 states and 749206 transitions. [2021-01-06 20:20:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:20:07,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:20:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:20:08,323 INFO L225 Difference]: With dead ends: 474187 [2021-01-06 20:20:08,323 INFO L226 Difference]: Without dead ends: 316165 [2021-01-06 20:20:08,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:20:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316165 states. [2021-01-06 20:20:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316165 to 158123. [2021-01-06 20:20:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158123 states. [2021-01-06 20:20:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158123 states to 158123 states and 249823 transitions. [2021-01-06 20:20:23,110 INFO L78 Accepts]: Start accepts. Automaton has 158123 states and 249823 transitions. Word has length 64 [2021-01-06 20:20:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:20:23,110 INFO L481 AbstractCegarLoop]: Abstraction has 158123 states and 249823 transitions. [2021-01-06 20:20:23,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:20:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 158123 states and 249823 transitions. [2021-01-06 20:20:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:20:23,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:20:23,113 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] [2021-01-06 20:20:23,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:20:23,113 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:20:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:20:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1712489959, now seen corresponding path program 1 times [2021-01-06 20:20:23,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:20:23,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24868279] [2021-01-06 20:20:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:20:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:20:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:20:23,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24868279] [2021-01-06 20:20:23,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:20:23,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:20:23,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485712188] [2021-01-06 20:20:23,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:20:23,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:20:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:20:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:20:23,237 INFO L87 Difference]: Start difference. First operand 158123 states and 249823 transitions. Second operand 5 states. [2021-01-06 20:20:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:20:48,114 INFO L93 Difference]: Finished difference Result 444835 states and 705763 transitions. [2021-01-06 20:20:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:20:48,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2021-01-06 20:20:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:20:48,946 INFO L225 Difference]: With dead ends: 444835 [2021-01-06 20:20:48,946 INFO L226 Difference]: Without dead ends: 287409 [2021-01-06 20:20:49,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:20:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287409 states.