/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 10:01:40,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 10:01:40,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 10:01:40,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 10:01:40,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 10:01:40,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 10:01:40,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 10:01:40,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 10:01:40,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 10:01:40,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 10:01:40,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 10:01:40,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 10:01:40,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 10:01:40,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 10:01:40,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 10:01:40,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 10:01:40,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 10:01:40,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 10:01:40,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 10:01:40,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 10:01:40,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 10:01:40,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 10:01:40,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 10:01:40,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 10:01:40,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 10:01:40,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 10:01:40,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 10:01:40,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 10:01:40,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 10:01:40,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 10:01:40,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 10:01:40,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 10:01:40,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 10:01:40,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 10:01:40,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 10:01:40,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 10:01:40,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 10:01:40,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 10:01:40,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 10:01:40,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 10:01:40,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 10:01:40,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 10:01:40,891 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 10:01:40,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 10:01:40,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 10:01:40,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 10:01:40,897 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 10:01:40,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 10:01:40,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 10:01:40,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 10:01:40,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 10:01:40,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 10:01:40,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 10:01:40,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 10:01:40,900 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 10:01:40,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 10:01:40,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 10:01:40,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 10:01:40,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 10:01:40,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:01:40,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 10:01:40,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 10:01:40,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 10:01:40,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 10:01:40,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 10:01:40,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 10:01:40,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 10:01:40,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 10:01:41,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 10:01:41,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 10:01:41,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 10:01:41,317 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 10:01:41,317 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 10:01:41,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2020-12-23 10:01:41,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/00ae320fa/df6cf2e2b7a74c14a2166b4a487e19c2/FLAG85fa92c48 [2020-12-23 10:01:41,982 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 10:01:41,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2020-12-23 10:01:42,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/00ae320fa/df6cf2e2b7a74c14a2166b4a487e19c2/FLAG85fa92c48 [2020-12-23 10:01:42,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/00ae320fa/df6cf2e2b7a74c14a2166b4a487e19c2 [2020-12-23 10:01:42,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 10:01:42,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 10:01:42,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 10:01:42,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 10:01:42,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 10:01:42,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71acf472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42, skipping insertion in model container [2020-12-23 10:01:42,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 10:01:42,424 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:01:42,683 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2020-12-23 10:01:42,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:01:42,698 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:01:42,780 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2020-12-23 10:01:42,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:01:42,835 INFO L208 MainTranslator]: Completed translation [2020-12-23 10:01:42,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42 WrapperNode [2020-12-23 10:01:42,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 10:01:42,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 10:01:42,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 10:01:42,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 10:01:42,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 10:01:42,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 10:01:42,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 10:01:42,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 10:01:42,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... [2020-12-23 10:01:42,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 10:01:42,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 10:01:42,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 10:01:42,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 10:01:42,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:01:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 10:01:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 10:01:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 10:01:43,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 10:01:44,170 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 10:01:44,171 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2020-12-23 10:01:44,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:01:44 BoogieIcfgContainer [2020-12-23 10:01:44,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 10:01:44,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 10:01:44,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 10:01:44,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 10:01:44,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:01:42" (1/3) ... [2020-12-23 10:01:44,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277174df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:01:44, skipping insertion in model container [2020-12-23 10:01:44,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:01:42" (2/3) ... [2020-12-23 10:01:44,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277174df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:01:44, skipping insertion in model container [2020-12-23 10:01:44,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:01:44" (3/3) ... [2020-12-23 10:01:44,182 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2020-12-23 10:01:44,189 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 10:01:44,195 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 10:01:44,215 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 10:01:44,242 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 10:01:44,243 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 10:01:44,243 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 10:01:44,243 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 10:01:44,243 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 10:01:44,244 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 10:01:44,244 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 10:01:44,244 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 10:01:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2020-12-23 10:01:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:01:44,273 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:44,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:44,274 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash -479003881, now seen corresponding path program 1 times [2020-12-23 10:01:44,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:44,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580783154] [2020-12-23 10:01:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:44,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580783154] [2020-12-23 10:01:44,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:44,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 10:01:44,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212330310] [2020-12-23 10:01:44,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 10:01:44,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:44,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 10:01:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:01:44,593 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 2 states. [2020-12-23 10:01:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:44,648 INFO L93 Difference]: Finished difference Result 221 states and 376 transitions. [2020-12-23 10:01:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 10:01:44,649 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-12-23 10:01:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:44,678 INFO L225 Difference]: With dead ends: 221 [2020-12-23 10:01:44,678 INFO L226 Difference]: Without dead ends: 133 [2020-12-23 10:01:44,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:01:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-23 10:01:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-12-23 10:01:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-23 10:01:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 229 transitions. [2020-12-23 10:01:44,737 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 229 transitions. Word has length 37 [2020-12-23 10:01:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:44,738 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 229 transitions. [2020-12-23 10:01:44,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 10:01:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2020-12-23 10:01:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:01:44,741 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:44,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:44,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 10:01:44,742 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1296652331, now seen corresponding path program 1 times [2020-12-23 10:01:44,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:44,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121493320] [2020-12-23 10:01:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:44,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121493320] [2020-12-23 10:01:44,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:44,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:01:44,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556637548] [2020-12-23 10:01:44,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:01:44,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:44,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:01:44,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:44,965 INFO L87 Difference]: Start difference. First operand 133 states and 229 transitions. Second operand 5 states. [2020-12-23 10:01:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:45,061 INFO L93 Difference]: Finished difference Result 295 states and 499 transitions. [2020-12-23 10:01:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:01:45,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 10:01:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:45,064 INFO L225 Difference]: With dead ends: 295 [2020-12-23 10:01:45,065 INFO L226 Difference]: Without dead ends: 212 [2020-12-23 10:01:45,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:01:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-12-23 10:01:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 133. [2020-12-23 10:01:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-23 10:01:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2020-12-23 10:01:45,081 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 37 [2020-12-23 10:01:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:45,082 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2020-12-23 10:01:45,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:01:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2020-12-23 10:01:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 10:01:45,085 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:45,085 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] [2020-12-23 10:01:45,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 10:01:45,085 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash 141893846, now seen corresponding path program 1 times [2020-12-23 10:01:45,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:45,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929783901] [2020-12-23 10:01:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:45,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929783901] [2020-12-23 10:01:45,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:45,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:45,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359983830] [2020-12-23 10:01:45,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:45,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:45,208 INFO L87 Difference]: Start difference. First operand 133 states and 205 transitions. Second operand 3 states. [2020-12-23 10:01:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:45,250 INFO L93 Difference]: Finished difference Result 281 states and 453 transitions. [2020-12-23 10:01:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:45,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-12-23 10:01:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:45,253 INFO L225 Difference]: With dead ends: 281 [2020-12-23 10:01:45,253 INFO L226 Difference]: Without dead ends: 202 [2020-12-23 10:01:45,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-12-23 10:01:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2020-12-23 10:01:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-23 10:01:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2020-12-23 10:01:45,270 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 60 [2020-12-23 10:01:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:45,271 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2020-12-23 10:01:45,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2020-12-23 10:01:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 10:01:45,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:45,274 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] [2020-12-23 10:01:45,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 10:01:45,275 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash -653639893, now seen corresponding path program 1 times [2020-12-23 10:01:45,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:45,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599210284] [2020-12-23 10:01:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:45,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599210284] [2020-12-23 10:01:45,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:45,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:45,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408008717] [2020-12-23 10:01:45,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:45,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:45,391 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2020-12-23 10:01:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:45,430 INFO L93 Difference]: Finished difference Result 476 states and 770 transitions. [2020-12-23 10:01:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:45,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-23 10:01:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:45,436 INFO L225 Difference]: With dead ends: 476 [2020-12-23 10:01:45,437 INFO L226 Difference]: Without dead ends: 330 [2020-12-23 10:01:45,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-12-23 10:01:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2020-12-23 10:01:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-12-23 10:01:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 525 transitions. [2020-12-23 10:01:45,504 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 525 transitions. Word has length 62 [2020-12-23 10:01:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:45,506 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 525 transitions. [2020-12-23 10:01:45,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 525 transitions. [2020-12-23 10:01:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 10:01:45,513 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:45,513 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] [2020-12-23 10:01:45,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 10:01:45,517 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1628052192, now seen corresponding path program 1 times [2020-12-23 10:01:45,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:45,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206494287] [2020-12-23 10:01:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:45,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206494287] [2020-12-23 10:01:45,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:45,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:45,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492010300] [2020-12-23 10:01:45,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:45,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:45,632 INFO L87 Difference]: Start difference. First operand 328 states and 525 transitions. Second operand 3 states. [2020-12-23 10:01:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:45,664 INFO L93 Difference]: Finished difference Result 844 states and 1375 transitions. [2020-12-23 10:01:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:45,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-23 10:01:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:45,668 INFO L225 Difference]: With dead ends: 844 [2020-12-23 10:01:45,668 INFO L226 Difference]: Without dead ends: 570 [2020-12-23 10:01:45,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-12-23 10:01:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2020-12-23 10:01:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2020-12-23 10:01:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 917 transitions. [2020-12-23 10:01:45,690 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 917 transitions. Word has length 64 [2020-12-23 10:01:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:45,690 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 917 transitions. [2020-12-23 10:01:45,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 917 transitions. [2020-12-23 10:01:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 10:01:45,693 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:45,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:45,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 10:01:45,694 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1698900981, now seen corresponding path program 1 times [2020-12-23 10:01:45,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:45,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439639593] [2020-12-23 10:01:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:45,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439639593] [2020-12-23 10:01:45,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:45,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:01:45,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987394964] [2020-12-23 10:01:45,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:01:45,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:45,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:01:45,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:45,831 INFO L87 Difference]: Start difference. First operand 568 states and 917 transitions. Second operand 5 states. [2020-12-23 10:01:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:46,038 INFO L93 Difference]: Finished difference Result 2170 states and 3586 transitions. [2020-12-23 10:01:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:01:46,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2020-12-23 10:01:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:46,049 INFO L225 Difference]: With dead ends: 2170 [2020-12-23 10:01:46,049 INFO L226 Difference]: Without dead ends: 1656 [2020-12-23 10:01:46,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:01:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-12-23 10:01:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1017. [2020-12-23 10:01:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2020-12-23 10:01:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1655 transitions. [2020-12-23 10:01:46,098 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1655 transitions. Word has length 66 [2020-12-23 10:01:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:46,099 INFO L481 AbstractCegarLoop]: Abstraction has 1017 states and 1655 transitions. [2020-12-23 10:01:46,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:01:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1655 transitions. [2020-12-23 10:01:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 10:01:46,101 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:46,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:46,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 10:01:46,102 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash -796509765, now seen corresponding path program 1 times [2020-12-23 10:01:46,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:46,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674112534] [2020-12-23 10:01:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:46,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674112534] [2020-12-23 10:01:46,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:46,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:01:46,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722323772] [2020-12-23 10:01:46,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:01:46,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:01:46,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:01:46,197 INFO L87 Difference]: Start difference. First operand 1017 states and 1655 transitions. Second operand 4 states. [2020-12-23 10:01:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:46,333 INFO L93 Difference]: Finished difference Result 2966 states and 4892 transitions. [2020-12-23 10:01:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:01:46,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-12-23 10:01:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:46,345 INFO L225 Difference]: With dead ends: 2966 [2020-12-23 10:01:46,345 INFO L226 Difference]: Without dead ends: 2003 [2020-12-23 10:01:46,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2020-12-23 10:01:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1501. [2020-12-23 10:01:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2020-12-23 10:01:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2453 transitions. [2020-12-23 10:01:46,441 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2453 transitions. Word has length 67 [2020-12-23 10:01:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:46,443 INFO L481 AbstractCegarLoop]: Abstraction has 1501 states and 2453 transitions. [2020-12-23 10:01:46,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:01:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2453 transitions. [2020-12-23 10:01:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 10:01:46,446 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:46,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:46,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 10:01:46,447 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2022785868, now seen corresponding path program 1 times [2020-12-23 10:01:46,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:46,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655460277] [2020-12-23 10:01:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:46,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655460277] [2020-12-23 10:01:46,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:46,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:46,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341938776] [2020-12-23 10:01:46,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:46,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:46,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:46,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:46,562 INFO L87 Difference]: Start difference. First operand 1501 states and 2453 transitions. Second operand 3 states. [2020-12-23 10:01:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:46,652 INFO L93 Difference]: Finished difference Result 3316 states and 5473 transitions. [2020-12-23 10:01:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:46,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 10:01:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:46,665 INFO L225 Difference]: With dead ends: 3316 [2020-12-23 10:01:46,665 INFO L226 Difference]: Without dead ends: 2278 [2020-12-23 10:01:46,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2020-12-23 10:01:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2020-12-23 10:01:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2020-12-23 10:01:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3722 transitions. [2020-12-23 10:01:46,794 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3722 transitions. Word has length 68 [2020-12-23 10:01:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:46,794 INFO L481 AbstractCegarLoop]: Abstraction has 2276 states and 3722 transitions. [2020-12-23 10:01:46,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3722 transitions. [2020-12-23 10:01:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 10:01:46,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:46,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:46,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 10:01:46,796 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash -675827220, now seen corresponding path program 1 times [2020-12-23 10:01:46,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:46,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768794477] [2020-12-23 10:01:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:46,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768794477] [2020-12-23 10:01:46,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:46,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:01:46,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96621813] [2020-12-23 10:01:46,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:01:46,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:46,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:01:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:01:46,936 INFO L87 Difference]: Start difference. First operand 2276 states and 3722 transitions. Second operand 4 states. [2020-12-23 10:01:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:47,148 INFO L93 Difference]: Finished difference Result 6680 states and 10988 transitions. [2020-12-23 10:01:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:01:47,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-12-23 10:01:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:47,172 INFO L225 Difference]: With dead ends: 6680 [2020-12-23 10:01:47,172 INFO L226 Difference]: Without dead ends: 4460 [2020-12-23 10:01:47,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2020-12-23 10:01:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 3349. [2020-12-23 10:01:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3349 states. [2020-12-23 10:01:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 5462 transitions. [2020-12-23 10:01:47,373 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 5462 transitions. Word has length 68 [2020-12-23 10:01:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:47,373 INFO L481 AbstractCegarLoop]: Abstraction has 3349 states and 5462 transitions. [2020-12-23 10:01:47,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:01:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 5462 transitions. [2020-12-23 10:01:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 10:01:47,375 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:47,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:47,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 10:01:47,376 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:47,376 INFO L82 PathProgramCache]: Analyzing trace with hash -446846068, now seen corresponding path program 1 times [2020-12-23 10:01:47,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:47,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380407380] [2020-12-23 10:01:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:47,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380407380] [2020-12-23 10:01:47,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:47,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:47,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252109919] [2020-12-23 10:01:47,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:47,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:47,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:47,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:47,445 INFO L87 Difference]: Start difference. First operand 3349 states and 5462 transitions. Second operand 3 states. [2020-12-23 10:01:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:47,616 INFO L93 Difference]: Finished difference Result 6705 states and 10949 transitions. [2020-12-23 10:01:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:47,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 10:01:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:47,640 INFO L225 Difference]: With dead ends: 6705 [2020-12-23 10:01:47,641 INFO L226 Difference]: Without dead ends: 4777 [2020-12-23 10:01:47,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2020-12-23 10:01:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4775. [2020-12-23 10:01:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2020-12-23 10:01:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 7737 transitions. [2020-12-23 10:01:47,863 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 7737 transitions. Word has length 68 [2020-12-23 10:01:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:47,863 INFO L481 AbstractCegarLoop]: Abstraction has 4775 states and 7737 transitions. [2020-12-23 10:01:47,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 7737 transitions. [2020-12-23 10:01:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 10:01:47,864 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:47,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:47,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 10:01:47,865 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:47,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1835740012, now seen corresponding path program 1 times [2020-12-23 10:01:47,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:47,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782174190] [2020-12-23 10:01:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:47,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782174190] [2020-12-23 10:01:47,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:47,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:47,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296296825] [2020-12-23 10:01:47,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:47,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:47,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:47,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:47,915 INFO L87 Difference]: Start difference. First operand 4775 states and 7737 transitions. Second operand 3 states. [2020-12-23 10:01:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:48,143 INFO L93 Difference]: Finished difference Result 10402 states and 16876 transitions. [2020-12-23 10:01:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:48,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 10:01:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:48,181 INFO L225 Difference]: With dead ends: 10402 [2020-12-23 10:01:48,181 INFO L226 Difference]: Without dead ends: 7073 [2020-12-23 10:01:48,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7073 states. [2020-12-23 10:01:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7073 to 7071. [2020-12-23 10:01:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7071 states. [2020-12-23 10:01:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 11369 transitions. [2020-12-23 10:01:48,550 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 11369 transitions. Word has length 68 [2020-12-23 10:01:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:48,550 INFO L481 AbstractCegarLoop]: Abstraction has 7071 states and 11369 transitions. [2020-12-23 10:01:48,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 11369 transitions. [2020-12-23 10:01:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 10:01:48,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:48,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:48,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 10:01:48,552 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1060631278, now seen corresponding path program 1 times [2020-12-23 10:01:48,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:48,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895687101] [2020-12-23 10:01:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:48,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895687101] [2020-12-23 10:01:48,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:48,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:01:48,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962065097] [2020-12-23 10:01:48,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:01:48,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:48,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:01:48,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:01:48,636 INFO L87 Difference]: Start difference. First operand 7071 states and 11369 transitions. Second operand 4 states. [2020-12-23 10:01:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:49,161 INFO L93 Difference]: Finished difference Result 22178 states and 35738 transitions. [2020-12-23 10:01:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:01:49,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-23 10:01:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:49,205 INFO L225 Difference]: With dead ends: 22178 [2020-12-23 10:01:49,205 INFO L226 Difference]: Without dead ends: 15187 [2020-12-23 10:01:49,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15187 states. [2020-12-23 10:01:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15187 to 11086. [2020-12-23 10:01:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11086 states. [2020-12-23 10:01:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11086 states to 11086 states and 17718 transitions. [2020-12-23 10:01:49,802 INFO L78 Accepts]: Start accepts. Automaton has 11086 states and 17718 transitions. Word has length 69 [2020-12-23 10:01:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:49,802 INFO L481 AbstractCegarLoop]: Abstraction has 11086 states and 17718 transitions. [2020-12-23 10:01:49,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:01:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 11086 states and 17718 transitions. [2020-12-23 10:01:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 10:01:49,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:49,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:49,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 10:01:49,804 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash 808037418, now seen corresponding path program 1 times [2020-12-23 10:01:49,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:49,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866034161] [2020-12-23 10:01:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:50,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866034161] [2020-12-23 10:01:50,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:50,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:01:50,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291592974] [2020-12-23 10:01:50,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:01:50,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:01:50,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:01:50,021 INFO L87 Difference]: Start difference. First operand 11086 states and 17718 transitions. Second operand 4 states. [2020-12-23 10:01:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:50,812 INFO L93 Difference]: Finished difference Result 32753 states and 52282 transitions. [2020-12-23 10:01:50,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:01:50,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-12-23 10:01:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:50,870 INFO L225 Difference]: With dead ends: 32753 [2020-12-23 10:01:50,870 INFO L226 Difference]: Without dead ends: 21676 [2020-12-23 10:01:50,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21676 states. [2020-12-23 10:01:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21676 to 21674. [2020-12-23 10:01:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21674 states. [2020-12-23 10:01:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21674 states to 21674 states and 34352 transitions. [2020-12-23 10:01:51,903 INFO L78 Accepts]: Start accepts. Automaton has 21674 states and 34352 transitions. Word has length 71 [2020-12-23 10:01:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:51,903 INFO L481 AbstractCegarLoop]: Abstraction has 21674 states and 34352 transitions. [2020-12-23 10:01:51,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:01:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21674 states and 34352 transitions. [2020-12-23 10:01:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 10:01:51,905 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:51,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:51,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 10:01:51,905 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1928866513, now seen corresponding path program 1 times [2020-12-23 10:01:51,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:51,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616942611] [2020-12-23 10:01:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:51,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616942611] [2020-12-23 10:01:51,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:51,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:51,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345220002] [2020-12-23 10:01:51,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:51,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:51,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:51,962 INFO L87 Difference]: Start difference. First operand 21674 states and 34352 transitions. Second operand 3 states. [2020-12-23 10:01:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:53,224 INFO L93 Difference]: Finished difference Result 52569 states and 83812 transitions. [2020-12-23 10:01:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:53,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-23 10:01:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:53,318 INFO L225 Difference]: With dead ends: 52569 [2020-12-23 10:01:53,318 INFO L226 Difference]: Without dead ends: 31012 [2020-12-23 10:01:53,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31012 states. [2020-12-23 10:01:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31012 to 30100. [2020-12-23 10:01:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30100 states. [2020-12-23 10:01:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30100 states to 30100 states and 47575 transitions. [2020-12-23 10:01:54,808 INFO L78 Accepts]: Start accepts. Automaton has 30100 states and 47575 transitions. Word has length 72 [2020-12-23 10:01:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:54,808 INFO L481 AbstractCegarLoop]: Abstraction has 30100 states and 47575 transitions. [2020-12-23 10:01:54,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30100 states and 47575 transitions. [2020-12-23 10:01:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 10:01:54,809 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:54,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:54,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 10:01:54,810 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1731694218, now seen corresponding path program 1 times [2020-12-23 10:01:54,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:54,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955768652] [2020-12-23 10:01:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:54,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955768652] [2020-12-23 10:01:54,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:54,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:54,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498214181] [2020-12-23 10:01:54,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:54,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:54,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:54,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:54,846 INFO L87 Difference]: Start difference. First operand 30100 states and 47575 transitions. Second operand 3 states. [2020-12-23 10:01:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:56,240 INFO L93 Difference]: Finished difference Result 90262 states and 142663 transitions. [2020-12-23 10:01:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:56,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-23 10:01:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:56,461 INFO L225 Difference]: With dead ends: 90262 [2020-12-23 10:01:56,462 INFO L226 Difference]: Without dead ends: 60190 [2020-12-23 10:01:56,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60190 states. [2020-12-23 10:01:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60190 to 30102. [2020-12-23 10:01:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30102 states. [2020-12-23 10:01:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30102 states to 30102 states and 47577 transitions. [2020-12-23 10:01:57,849 INFO L78 Accepts]: Start accepts. Automaton has 30102 states and 47577 transitions. Word has length 72 [2020-12-23 10:01:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:57,849 INFO L481 AbstractCegarLoop]: Abstraction has 30102 states and 47577 transitions. [2020-12-23 10:01:57,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30102 states and 47577 transitions. [2020-12-23 10:01:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 10:01:57,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:57,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:57,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:01:57,851 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash -337778154, now seen corresponding path program 1 times [2020-12-23 10:01:57,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:57,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036881023] [2020-12-23 10:01:57,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:57,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036881023] [2020-12-23 10:01:57,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:57,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:01:57,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098247944] [2020-12-23 10:01:57,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:01:57,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:01:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:01:57,942 INFO L87 Difference]: Start difference. First operand 30102 states and 47577 transitions. Second operand 4 states. [2020-12-23 10:01:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:59,697 INFO L93 Difference]: Finished difference Result 88948 states and 140409 transitions. [2020-12-23 10:01:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:01:59,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-12-23 10:01:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:59,797 INFO L225 Difference]: With dead ends: 88948 [2020-12-23 10:01:59,797 INFO L226 Difference]: Without dead ends: 58876 [2020-12-23 10:01:59,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:01:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58876 states. [2020-12-23 10:02:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58876 to 58874. [2020-12-23 10:02:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58874 states. [2020-12-23 10:02:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58874 states to 58874 states and 92320 transitions. [2020-12-23 10:02:02,092 INFO L78 Accepts]: Start accepts. Automaton has 58874 states and 92320 transitions. Word has length 73 [2020-12-23 10:02:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:02,093 INFO L481 AbstractCegarLoop]: Abstraction has 58874 states and 92320 transitions. [2020-12-23 10:02:02,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:02:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 58874 states and 92320 transitions. [2020-12-23 10:02:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:02:02,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:02,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:02,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:02:02,094 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:02,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1275444434, now seen corresponding path program 1 times [2020-12-23 10:02:02,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:02,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146854911] [2020-12-23 10:02:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:02:02,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146854911] [2020-12-23 10:02:02,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:02,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:02,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819568220] [2020-12-23 10:02:02,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:02,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:02,140 INFO L87 Difference]: Start difference. First operand 58874 states and 92320 transitions. Second operand 3 states. [2020-12-23 10:02:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:04,879 INFO L93 Difference]: Finished difference Result 142442 states and 224184 transitions. [2020-12-23 10:02:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:04,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:02:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:05,007 INFO L225 Difference]: With dead ends: 142442 [2020-12-23 10:02:05,008 INFO L226 Difference]: Without dead ends: 83824 [2020-12-23 10:02:05,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83824 states. [2020-12-23 10:02:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83824 to 81518. [2020-12-23 10:02:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81518 states. [2020-12-23 10:02:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81518 states to 81518 states and 127222 transitions. [2020-12-23 10:02:08,034 INFO L78 Accepts]: Start accepts. Automaton has 81518 states and 127222 transitions. Word has length 74 [2020-12-23 10:02:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:08,034 INFO L481 AbstractCegarLoop]: Abstraction has 81518 states and 127222 transitions. [2020-12-23 10:02:08,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 81518 states and 127222 transitions. [2020-12-23 10:02:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:02:08,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:08,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:08,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:02:08,036 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2143634658, now seen corresponding path program 1 times [2020-12-23 10:02:08,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:08,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722099009] [2020-12-23 10:02:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:02:08,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722099009] [2020-12-23 10:02:08,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:08,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:08,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051199168] [2020-12-23 10:02:08,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:08,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:08,085 INFO L87 Difference]: Start difference. First operand 81518 states and 127222 transitions. Second operand 3 states. [2020-12-23 10:02:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:13,087 INFO L93 Difference]: Finished difference Result 244478 states and 381546 transitions. [2020-12-23 10:02:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:13,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 10:02:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:13,387 INFO L225 Difference]: With dead ends: 244478 [2020-12-23 10:02:13,387 INFO L226 Difference]: Without dead ends: 163004 [2020-12-23 10:02:13,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163004 states. [2020-12-23 10:02:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163004 to 81522. [2020-12-23 10:02:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81522 states. [2020-12-23 10:02:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81522 states to 81522 states and 127226 transitions. [2020-12-23 10:02:17,229 INFO L78 Accepts]: Start accepts. Automaton has 81522 states and 127226 transitions. Word has length 74 [2020-12-23 10:02:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:17,229 INFO L481 AbstractCegarLoop]: Abstraction has 81522 states and 127226 transitions. [2020-12-23 10:02:17,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 81522 states and 127226 transitions. [2020-12-23 10:02:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 10:02:17,231 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:17,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:17,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:02:17,231 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:17,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:17,232 INFO L82 PathProgramCache]: Analyzing trace with hash 102231554, now seen corresponding path program 1 times [2020-12-23 10:02:17,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:17,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243538771] [2020-12-23 10:02:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:02:17,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243538771] [2020-12-23 10:02:17,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:17,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:02:17,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110347547] [2020-12-23 10:02:17,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:02:17,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:17,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:02:17,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:02:17,365 INFO L87 Difference]: Start difference. First operand 81522 states and 127226 transitions. Second operand 4 states. [2020-12-23 10:02:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:22,626 INFO L93 Difference]: Finished difference Result 240818 states and 375274 transitions. [2020-12-23 10:02:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:02:22,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 10:02:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:22,930 INFO L225 Difference]: With dead ends: 240818 [2020-12-23 10:02:22,931 INFO L226 Difference]: Without dead ends: 159344 [2020-12-23 10:02:22,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:02:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159344 states. [2020-12-23 10:02:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159344 to 159342. [2020-12-23 10:02:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159342 states. [2020-12-23 10:02:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159342 states to 159342 states and 246552 transitions. [2020-12-23 10:02:29,444 INFO L78 Accepts]: Start accepts. Automaton has 159342 states and 246552 transitions. Word has length 75 [2020-12-23 10:02:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:29,444 INFO L481 AbstractCegarLoop]: Abstraction has 159342 states and 246552 transitions. [2020-12-23 10:02:29,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:02:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 159342 states and 246552 transitions. [2020-12-23 10:02:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 10:02:29,447 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:29,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:29,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:02:29,447 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1897914443, now seen corresponding path program 1 times [2020-12-23 10:02:29,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:29,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464931685] [2020-12-23 10:02:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:02:29,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464931685] [2020-12-23 10:02:29,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:29,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:29,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833701877] [2020-12-23 10:02:29,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:29,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:29,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:29,503 INFO L87 Difference]: Start difference. First operand 159342 states and 246552 transitions. Second operand 3 states. [2020-12-23 10:02:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:37,280 INFO L93 Difference]: Finished difference Result 386266 states and 600602 transitions. [2020-12-23 10:02:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:02:37,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 10:02:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:37,965 INFO L225 Difference]: With dead ends: 386266 [2020-12-23 10:02:37,965 INFO L226 Difference]: Without dead ends: 227440 [2020-12-23 10:02:38,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227440 states. [2020-12-23 10:02:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227440 to 220238. [2020-12-23 10:02:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220238 states. [2020-12-23 10:02:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220238 states to 220238 states and 338560 transitions. [2020-12-23 10:02:47,530 INFO L78 Accepts]: Start accepts. Automaton has 220238 states and 338560 transitions. Word has length 76 [2020-12-23 10:02:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:47,530 INFO L481 AbstractCegarLoop]: Abstraction has 220238 states and 338560 transitions. [2020-12-23 10:02:47,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:02:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 220238 states and 338560 transitions. [2020-12-23 10:02:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 10:02:47,532 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:47,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:02:47,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 10:02:47,540 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1851212210, now seen corresponding path program 1 times [2020-12-23 10:02:47,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:47,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632842876] [2020-12-23 10:02:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:02:47,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632842876] [2020-12-23 10:02:47,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:47,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:47,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321879867] [2020-12-23 10:02:47,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:47,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:47,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:47,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:47,586 INFO L87 Difference]: Start difference. First operand 220238 states and 338560 transitions. Second operand 3 states. [2020-12-23 10:03:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:02,364 INFO L93 Difference]: Finished difference Result 660314 states and 1015158 transitions. [2020-12-23 10:03:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:02,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 10:03:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:03,511 INFO L225 Difference]: With dead ends: 660314 [2020-12-23 10:03:03,511 INFO L226 Difference]: Without dead ends: 440384 [2020-12-23 10:03:03,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440384 states. [2020-12-23 10:03:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440384 to 220246. [2020-12-23 10:03:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220246 states. [2020-12-23 10:03:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220246 states to 220246 states and 338568 transitions. [2020-12-23 10:03:16,077 INFO L78 Accepts]: Start accepts. Automaton has 220246 states and 338568 transitions. Word has length 76 [2020-12-23 10:03:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:16,077 INFO L481 AbstractCegarLoop]: Abstraction has 220246 states and 338568 transitions. [2020-12-23 10:03:16,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 220246 states and 338568 transitions. [2020-12-23 10:03:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 10:03:16,080 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:16,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:16,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 10:03:16,080 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2120268233, now seen corresponding path program 1 times [2020-12-23 10:03:16,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:16,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790474011] [2020-12-23 10:03:16,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:16,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790474011] [2020-12-23 10:03:16,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:16,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:03:16,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415174751] [2020-12-23 10:03:16,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:03:16,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:03:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:16,260 INFO L87 Difference]: Start difference. First operand 220246 states and 338568 transitions. Second operand 5 states. [2020-12-23 10:03:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:33,198 INFO L93 Difference]: Finished difference Result 622384 states and 956113 transitions. [2020-12-23 10:03:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:33,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-12-23 10:03:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:34,095 INFO L225 Difference]: With dead ends: 622384 [2020-12-23 10:03:34,095 INFO L226 Difference]: Without dead ends: 402226 [2020-12-23 10:03:34,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402226 states. [2020-12-23 10:03:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402226 to 402224. [2020-12-23 10:03:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402224 states. [2020-12-23 10:03:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402224 states to 402224 states and 612689 transitions. [2020-12-23 10:03:53,778 INFO L78 Accepts]: Start accepts. Automaton has 402224 states and 612689 transitions. Word has length 77 [2020-12-23 10:03:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:53,778 INFO L481 AbstractCegarLoop]: Abstraction has 402224 states and 612689 transitions. [2020-12-23 10:03:53,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:03:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 402224 states and 612689 transitions. [2020-12-23 10:03:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 10:03:53,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:53,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:53,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 10:03:53,783 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1141983250, now seen corresponding path program 1 times [2020-12-23 10:03:53,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:53,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922883452] [2020-12-23 10:03:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:54,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922883452] [2020-12-23 10:03:54,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:54,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:03:54,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988663580] [2020-12-23 10:03:54,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:03:54,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:54,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:03:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:54,008 INFO L87 Difference]: Start difference. First operand 402224 states and 612689 transitions. Second operand 5 states. [2020-12-23 10:04:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:14,629 INFO L93 Difference]: Finished difference Result 866582 states and 1324212 transitions. [2020-12-23 10:04:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 10:04:14,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-12-23 10:04:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:15,897 INFO L225 Difference]: With dead ends: 866582 [2020-12-23 10:04:15,898 INFO L226 Difference]: Without dead ends: 465364 [2020-12-23 10:04:16,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:04:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465364 states. [2020-12-23 10:04:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465364 to 402224. [2020-12-23 10:04:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402224 states. [2020-12-23 10:04:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402224 states to 402224 states and 607593 transitions. [2020-12-23 10:04:38,018 INFO L78 Accepts]: Start accepts. Automaton has 402224 states and 607593 transitions. Word has length 77 [2020-12-23 10:04:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:38,019 INFO L481 AbstractCegarLoop]: Abstraction has 402224 states and 607593 transitions. [2020-12-23 10:04:38,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:04:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 402224 states and 607593 transitions. [2020-12-23 10:04:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 10:04:38,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:38,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:38,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 10:04:38,048 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1315913451, now seen corresponding path program 1 times [2020-12-23 10:04:38,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:38,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987611528] [2020-12-23 10:04:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:38,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987611528] [2020-12-23 10:04:38,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:38,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:04:38,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065992013] [2020-12-23 10:04:38,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:04:38,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:38,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:04:38,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:04:38,207 INFO L87 Difference]: Start difference. First operand 402224 states and 607593 transitions. Second operand 5 states.