/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:46:03,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:46:03,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:46:04,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:46:04,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:46:04,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:46:04,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:46:04,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:46:04,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:46:04,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:46:04,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:46:04,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:46:04,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:46:04,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:46:04,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:46:04,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:46:04,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:46:04,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:46:04,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:46:04,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:46:04,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:46:04,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:46:04,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:46:04,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:46:04,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:46:04,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:46:04,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:46:04,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:46:04,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:46:04,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:46:04,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:46:04,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:46:04,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:46:04,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:46:04,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:46:04,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:46:04,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:46:04,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:46:04,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:46:04,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:46:04,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:46:04,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:46:04,182 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:46:04,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:46:04,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:46:04,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:46:04,189 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:46:04,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:46:04,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:46:04,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:46:04,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:46:04,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:46:04,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:46:04,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:46:04,192 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:46:04,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:46:04,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:46:04,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:46:04,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:46:04,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:46:04,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:46:04,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:46:04,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:46:04,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:46:04,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:46:04,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:46:04,195 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:46:04,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:46:04,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:46:04,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:46:04,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:46:04,676 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:46:04,677 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:46:04,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:04,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2c02c6041/b37468260f5043c696d2cac4745cff86/FLAG0f9238718 [2021-01-06 19:46:05,551 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:46:05,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:05,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2c02c6041/b37468260f5043c696d2cac4745cff86/FLAG0f9238718 [2021-01-06 19:46:05,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2c02c6041/b37468260f5043c696d2cac4745cff86 [2021-01-06 19:46:05,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:46:05,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:46:05,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:05,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:46:05,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:46:05,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:05" (1/1) ... [2021-01-06 19:46:05,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c75a121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:05, skipping insertion in model container [2021-01-06 19:46:05,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:05" (1/1) ... [2021-01-06 19:46:05,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:46:05,966 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:46:06,253 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c[12667,12680] [2021-01-06 19:46:06,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:06,280 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:46:06,408 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c[12667,12680] [2021-01-06 19:46:06,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:06,433 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:46:06,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06 WrapperNode [2021-01-06 19:46:06,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:06,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:06,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:46:06,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:46:06,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:06,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:46:06,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:46:06,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:46:06,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... [2021-01-06 19:46:06,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:46:06,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:46:06,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:46:06,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:46:06,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:46:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:46:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:46:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:46:06,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:46:07,606 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:46:07,606 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-01-06 19:46:07,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:07 BoogieIcfgContainer [2021-01-06 19:46:07,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:46:07,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:46:07,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:46:07,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:46:07,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:46:05" (1/3) ... [2021-01-06 19:46:07,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137bae03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:07, skipping insertion in model container [2021-01-06 19:46:07,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:06" (2/3) ... [2021-01-06 19:46:07,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137bae03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:07, skipping insertion in model container [2021-01-06 19:46:07,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:07" (3/3) ... [2021-01-06 19:46:07,620 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:07,627 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:46:07,634 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:46:07,656 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:46:07,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:46:07,688 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:46:07,688 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:46:07,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:46:07,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:46:07,688 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:46:07,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:46:07,688 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:46:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2021-01-06 19:46:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:46:07,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:07,719 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] [2021-01-06 19:46:07,720 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:07,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1732857806, now seen corresponding path program 1 times [2021-01-06 19:46:07,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:07,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820481836] [2021-01-06 19:46:07,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:07,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820481836] [2021-01-06 19:46:07,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:07,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:46:07,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128160943] [2021-01-06 19:46:07,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:46:07,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:46:08,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:46:08,022 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2021-01-06 19:46:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:08,078 INFO L93 Difference]: Finished difference Result 199 states and 331 transitions. [2021-01-06 19:46:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:46:08,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2021-01-06 19:46:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:08,104 INFO L225 Difference]: With dead ends: 199 [2021-01-06 19:46:08,104 INFO L226 Difference]: Without dead ends: 116 [2021-01-06 19:46:08,108 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 [2021-01-06 19:46:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-06 19:46:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-01-06 19:46:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2021-01-06 19:46:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 195 transitions. [2021-01-06 19:46:08,157 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 195 transitions. Word has length 33 [2021-01-06 19:46:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:08,158 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 195 transitions. [2021-01-06 19:46:08,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:46:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 195 transitions. [2021-01-06 19:46:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:46:08,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:08,161 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] [2021-01-06 19:46:08,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:46:08,162 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:08,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:08,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2052636400, now seen corresponding path program 1 times [2021-01-06 19:46:08,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:08,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243198419] [2021-01-06 19:46:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:08,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243198419] [2021-01-06 19:46:08,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:08,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:46:08,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231019527] [2021-01-06 19:46:08,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:46:08,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:46:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:46:08,313 INFO L87 Difference]: Start difference. First operand 116 states and 195 transitions. Second operand 5 states. [2021-01-06 19:46:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:08,453 INFO L93 Difference]: Finished difference Result 198 states and 324 transitions. [2021-01-06 19:46:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:46:08,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2021-01-06 19:46:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:08,458 INFO L225 Difference]: With dead ends: 198 [2021-01-06 19:46:08,458 INFO L226 Difference]: Without dead ends: 116 [2021-01-06 19:46:08,459 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 [2021-01-06 19:46:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-06 19:46:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-01-06 19:46:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2021-01-06 19:46:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2021-01-06 19:46:08,480 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 33 [2021-01-06 19:46:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:08,481 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2021-01-06 19:46:08,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:46:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2021-01-06 19:46:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:46:08,487 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:08,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:08,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:46:08,489 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash 148306117, now seen corresponding path program 1 times [2021-01-06 19:46:08,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:08,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41091284] [2021-01-06 19:46:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:08,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41091284] [2021-01-06 19:46:08,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:08,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:08,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612582405] [2021-01-06 19:46:08,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:08,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:08,653 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand 3 states. [2021-01-06 19:46:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:08,705 INFO L93 Difference]: Finished difference Result 260 states and 393 transitions. [2021-01-06 19:46:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:08,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 19:46:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:08,708 INFO L225 Difference]: With dead ends: 260 [2021-01-06 19:46:08,708 INFO L226 Difference]: Without dead ends: 182 [2021-01-06 19:46:08,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-06 19:46:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2021-01-06 19:46:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2021-01-06 19:46:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 266 transitions. [2021-01-06 19:46:08,725 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 266 transitions. Word has length 64 [2021-01-06 19:46:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:08,726 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 266 transitions. [2021-01-06 19:46:08,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2021-01-06 19:46:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:46:08,727 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:08,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:08,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:46:08,728 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:08,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1747202786, now seen corresponding path program 1 times [2021-01-06 19:46:08,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:08,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574212472] [2021-01-06 19:46:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:08,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574212472] [2021-01-06 19:46:08,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:08,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:08,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711467649] [2021-01-06 19:46:08,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:08,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:08,854 INFO L87 Difference]: Start difference. First operand 180 states and 266 transitions. Second operand 3 states. [2021-01-06 19:46:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:08,880 INFO L93 Difference]: Finished difference Result 440 states and 682 transitions. [2021-01-06 19:46:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:08,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:46:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:08,884 INFO L225 Difference]: With dead ends: 440 [2021-01-06 19:46:08,884 INFO L226 Difference]: Without dead ends: 298 [2021-01-06 19:46:08,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-01-06 19:46:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2021-01-06 19:46:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2021-01-06 19:46:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 451 transitions. [2021-01-06 19:46:08,934 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 451 transitions. Word has length 65 [2021-01-06 19:46:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:08,935 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 451 transitions. [2021-01-06 19:46:08,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 451 transitions. [2021-01-06 19:46:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:46:08,938 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:08,939 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] [2021-01-06 19:46:08,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:46:08,939 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 378408053, now seen corresponding path program 1 times [2021-01-06 19:46:08,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:08,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473953498] [2021-01-06 19:46:08,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:09,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473953498] [2021-01-06 19:46:09,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:09,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:09,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101764216] [2021-01-06 19:46:09,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:09,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:09,086 INFO L87 Difference]: Start difference. First operand 296 states and 451 transitions. Second operand 3 states. [2021-01-06 19:46:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:09,137 INFO L93 Difference]: Finished difference Result 764 states and 1197 transitions. [2021-01-06 19:46:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:09,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:46:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:09,144 INFO L225 Difference]: With dead ends: 764 [2021-01-06 19:46:09,145 INFO L226 Difference]: Without dead ends: 506 [2021-01-06 19:46:09,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-01-06 19:46:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2021-01-06 19:46:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2021-01-06 19:46:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 779 transitions. [2021-01-06 19:46:09,206 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 779 transitions. Word has length 66 [2021-01-06 19:46:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:09,207 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 779 transitions. [2021-01-06 19:46:09,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 779 transitions. [2021-01-06 19:46:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:46:09,212 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:09,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:09,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:46:09,213 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1350891378, now seen corresponding path program 1 times [2021-01-06 19:46:09,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:09,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846208576] [2021-01-06 19:46:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:09,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846208576] [2021-01-06 19:46:09,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:09,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:09,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968043338] [2021-01-06 19:46:09,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:09,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:09,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:09,347 INFO L87 Difference]: Start difference. First operand 504 states and 779 transitions. Second operand 3 states. [2021-01-06 19:46:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:09,401 INFO L93 Difference]: Finished difference Result 1340 states and 2101 transitions. [2021-01-06 19:46:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:09,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:46:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:09,409 INFO L225 Difference]: With dead ends: 1340 [2021-01-06 19:46:09,410 INFO L226 Difference]: Without dead ends: 874 [2021-01-06 19:46:09,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-01-06 19:46:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2021-01-06 19:46:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2021-01-06 19:46:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1351 transitions. [2021-01-06 19:46:09,456 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1351 transitions. Word has length 67 [2021-01-06 19:46:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:09,456 INFO L481 AbstractCegarLoop]: Abstraction has 872 states and 1351 transitions. [2021-01-06 19:46:09,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1351 transitions. [2021-01-06 19:46:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:46:09,458 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:09,459 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] [2021-01-06 19:46:09,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:46:09,461 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:09,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 644065317, now seen corresponding path program 1 times [2021-01-06 19:46:09,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:09,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338715008] [2021-01-06 19:46:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:09,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338715008] [2021-01-06 19:46:09,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:09,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:09,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668647157] [2021-01-06 19:46:09,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:09,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:09,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:09,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:09,585 INFO L87 Difference]: Start difference. First operand 872 states and 1351 transitions. Second operand 7 states. [2021-01-06 19:46:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:09,900 INFO L93 Difference]: Finished difference Result 5876 states and 9229 transitions. [2021-01-06 19:46:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:09,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2021-01-06 19:46:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:09,929 INFO L225 Difference]: With dead ends: 5876 [2021-01-06 19:46:09,929 INFO L226 Difference]: Without dead ends: 5042 [2021-01-06 19:46:09,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:46:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states. [2021-01-06 19:46:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 1704. [2021-01-06 19:46:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2021-01-06 19:46:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2631 transitions. [2021-01-06 19:46:10,053 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2631 transitions. Word has length 68 [2021-01-06 19:46:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:10,054 INFO L481 AbstractCegarLoop]: Abstraction has 1704 states and 2631 transitions. [2021-01-06 19:46:10,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2631 transitions. [2021-01-06 19:46:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:46:10,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:10,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:10,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:46:10,057 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1892134872, now seen corresponding path program 1 times [2021-01-06 19:46:10,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:10,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180573377] [2021-01-06 19:46:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:10,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180573377] [2021-01-06 19:46:10,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:10,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:10,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327808103] [2021-01-06 19:46:10,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:10,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:10,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:10,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:10,316 INFO L87 Difference]: Start difference. First operand 1704 states and 2631 transitions. Second operand 7 states. [2021-01-06 19:46:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:10,848 INFO L93 Difference]: Finished difference Result 9202 states and 14156 transitions. [2021-01-06 19:46:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:10,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2021-01-06 19:46:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:10,893 INFO L225 Difference]: With dead ends: 9202 [2021-01-06 19:46:10,893 INFO L226 Difference]: Without dead ends: 7536 [2021-01-06 19:46:10,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2021-01-06 19:46:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7528. [2021-01-06 19:46:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7528 states. [2021-01-06 19:46:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7528 states to 7528 states and 11527 transitions. [2021-01-06 19:46:11,411 INFO L78 Accepts]: Start accepts. Automaton has 7528 states and 11527 transitions. Word has length 69 [2021-01-06 19:46:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:11,411 INFO L481 AbstractCegarLoop]: Abstraction has 7528 states and 11527 transitions. [2021-01-06 19:46:11,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7528 states and 11527 transitions. [2021-01-06 19:46:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:46:11,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:11,413 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] [2021-01-06 19:46:11,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:46:11,414 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1491011308, now seen corresponding path program 1 times [2021-01-06 19:46:11,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:11,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964656987] [2021-01-06 19:46:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:11,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964656987] [2021-01-06 19:46:11,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:11,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:11,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204757879] [2021-01-06 19:46:11,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:11,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:11,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:11,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:11,587 INFO L87 Difference]: Start difference. First operand 7528 states and 11527 transitions. Second operand 8 states. [2021-01-06 19:46:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:12,645 INFO L93 Difference]: Finished difference Result 15658 states and 23656 transitions. [2021-01-06 19:46:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:46:12,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2021-01-06 19:46:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:12,722 INFO L225 Difference]: With dead ends: 15658 [2021-01-06 19:46:12,722 INFO L226 Difference]: Without dead ends: 15656 [2021-01-06 19:46:12,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:46:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15656 states. [2021-01-06 19:46:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15656 to 8008. [2021-01-06 19:46:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8008 states. [2021-01-06 19:46:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8008 states to 8008 states and 12007 transitions. [2021-01-06 19:46:13,447 INFO L78 Accepts]: Start accepts. Automaton has 8008 states and 12007 transitions. Word has length 70 [2021-01-06 19:46:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:13,447 INFO L481 AbstractCegarLoop]: Abstraction has 8008 states and 12007 transitions. [2021-01-06 19:46:13,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8008 states and 12007 transitions. [2021-01-06 19:46:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:46:13,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:13,449 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] [2021-01-06 19:46:13,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:46:13,450 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1075868401, now seen corresponding path program 1 times [2021-01-06 19:46:13,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:13,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094772517] [2021-01-06 19:46:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:13,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094772517] [2021-01-06 19:46:13,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:13,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:13,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917568401] [2021-01-06 19:46:13,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:13,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:13,527 INFO L87 Difference]: Start difference. First operand 8008 states and 12007 transitions. Second operand 3 states. [2021-01-06 19:46:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:14,411 INFO L93 Difference]: Finished difference Result 22092 states and 32985 transitions. [2021-01-06 19:46:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:14,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2021-01-06 19:46:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:14,471 INFO L225 Difference]: With dead ends: 22092 [2021-01-06 19:46:14,471 INFO L226 Difference]: Without dead ends: 14122 [2021-01-06 19:46:14,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14122 states. [2021-01-06 19:46:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14122 to 13976. [2021-01-06 19:46:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13976 states. [2021-01-06 19:46:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13976 states to 13976 states and 20583 transitions. [2021-01-06 19:46:15,540 INFO L78 Accepts]: Start accepts. Automaton has 13976 states and 20583 transitions. Word has length 71 [2021-01-06 19:46:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:15,541 INFO L481 AbstractCegarLoop]: Abstraction has 13976 states and 20583 transitions. [2021-01-06 19:46:15,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 13976 states and 20583 transitions. [2021-01-06 19:46:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:46:15,543 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:15,543 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] [2021-01-06 19:46:15,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:46:15,544 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1119250846, now seen corresponding path program 1 times [2021-01-06 19:46:15,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:15,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887383359] [2021-01-06 19:46:15,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:15,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887383359] [2021-01-06 19:46:15,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:15,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:15,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160699274] [2021-01-06 19:46:15,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:15,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:15,614 INFO L87 Difference]: Start difference. First operand 13976 states and 20583 transitions. Second operand 3 states. [2021-01-06 19:46:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:16,792 INFO L93 Difference]: Finished difference Result 28159 states and 41645 transitions. [2021-01-06 19:46:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:16,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:46:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:16,847 INFO L225 Difference]: With dead ends: 28159 [2021-01-06 19:46:16,847 INFO L226 Difference]: Without dead ends: 20188 [2021-01-06 19:46:16,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20188 states. [2021-01-06 19:46:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20188 to 20186. [2021-01-06 19:46:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2021-01-06 19:46:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 29513 transitions. [2021-01-06 19:46:18,311 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 29513 transitions. Word has length 72 [2021-01-06 19:46:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:18,311 INFO L481 AbstractCegarLoop]: Abstraction has 20186 states and 29513 transitions. [2021-01-06 19:46:18,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 29513 transitions. [2021-01-06 19:46:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:46:18,323 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:18,324 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:18,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:46:18,324 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1605278621, now seen corresponding path program 1 times [2021-01-06 19:46:18,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:18,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671973882] [2021-01-06 19:46:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:18,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671973882] [2021-01-06 19:46:18,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:18,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:18,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493974485] [2021-01-06 19:46:18,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:18,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:18,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:18,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:18,424 INFO L87 Difference]: Start difference. First operand 20186 states and 29513 transitions. Second operand 3 states. [2021-01-06 19:46:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:20,072 INFO L93 Difference]: Finished difference Result 50789 states and 74133 transitions. [2021-01-06 19:46:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:20,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 19:46:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:20,167 INFO L225 Difference]: With dead ends: 50789 [2021-01-06 19:46:20,168 INFO L226 Difference]: Without dead ends: 33891 [2021-01-06 19:46:20,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33891 states. [2021-01-06 19:46:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33891 to 32545. [2021-01-06 19:46:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32545 states. [2021-01-06 19:46:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32545 states to 32545 states and 47083 transitions. [2021-01-06 19:46:22,133 INFO L78 Accepts]: Start accepts. Automaton has 32545 states and 47083 transitions. Word has length 98 [2021-01-06 19:46:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:22,134 INFO L481 AbstractCegarLoop]: Abstraction has 32545 states and 47083 transitions. [2021-01-06 19:46:22,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 32545 states and 47083 transitions. [2021-01-06 19:46:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:46:22,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:22,156 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:22,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:46:22,156 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1583207469, now seen corresponding path program 1 times [2021-01-06 19:46:22,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:22,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332639966] [2021-01-06 19:46:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:46:22,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332639966] [2021-01-06 19:46:22,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:22,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:22,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573384445] [2021-01-06 19:46:22,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:22,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:22,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:22,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:22,271 INFO L87 Difference]: Start difference. First operand 32545 states and 47083 transitions. Second operand 7 states. [2021-01-06 19:46:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:25,108 INFO L93 Difference]: Finished difference Result 80293 states and 117329 transitions. [2021-01-06 19:46:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:25,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2021-01-06 19:46:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:25,271 INFO L225 Difference]: With dead ends: 80293 [2021-01-06 19:46:25,272 INFO L226 Difference]: Without dead ends: 67691 [2021-01-06 19:46:25,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:46:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67691 states. [2021-01-06 19:46:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67691 to 44857. [2021-01-06 19:46:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44857 states. [2021-01-06 19:46:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44857 states to 44857 states and 64891 transitions. [2021-01-06 19:46:27,826 INFO L78 Accepts]: Start accepts. Automaton has 44857 states and 64891 transitions. Word has length 98 [2021-01-06 19:46:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:27,827 INFO L481 AbstractCegarLoop]: Abstraction has 44857 states and 64891 transitions. [2021-01-06 19:46:27,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44857 states and 64891 transitions. [2021-01-06 19:46:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:46:27,847 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:27,848 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:27,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:46:27,848 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash 102749373, now seen corresponding path program 1 times [2021-01-06 19:46:27,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:27,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137978069] [2021-01-06 19:46:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:27,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137978069] [2021-01-06 19:46:27,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:27,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:27,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360018484] [2021-01-06 19:46:27,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:27,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:27,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:27,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:27,923 INFO L87 Difference]: Start difference. First operand 44857 states and 64891 transitions. Second operand 3 states. [2021-01-06 19:46:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:30,603 INFO L93 Difference]: Finished difference Result 89059 states and 128690 transitions. [2021-01-06 19:46:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:30,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 19:46:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:30,697 INFO L225 Difference]: With dead ends: 89059 [2021-01-06 19:46:30,697 INFO L226 Difference]: Without dead ends: 63665 [2021-01-06 19:46:30,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63665 states. [2021-01-06 19:46:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63665 to 58539. [2021-01-06 19:46:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58539 states. [2021-01-06 19:46:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58539 states to 58539 states and 83784 transitions. [2021-01-06 19:46:33,519 INFO L78 Accepts]: Start accepts. Automaton has 58539 states and 83784 transitions. Word has length 98 [2021-01-06 19:46:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:33,520 INFO L481 AbstractCegarLoop]: Abstraction has 58539 states and 83784 transitions. [2021-01-06 19:46:33,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 58539 states and 83784 transitions. [2021-01-06 19:46:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:46:33,540 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:33,540 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:33,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:46:33,541 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash 530095437, now seen corresponding path program 1 times [2021-01-06 19:46:33,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:33,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667429799] [2021-01-06 19:46:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:46:33,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667429799] [2021-01-06 19:46:33,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:33,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:33,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148722793] [2021-01-06 19:46:33,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:33,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:33,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:33,601 INFO L87 Difference]: Start difference. First operand 58539 states and 83784 transitions. Second operand 3 states. [2021-01-06 19:46:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:36,911 INFO L93 Difference]: Finished difference Result 92892 states and 132304 transitions. [2021-01-06 19:46:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:36,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 19:46:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:36,996 INFO L225 Difference]: With dead ends: 92892 [2021-01-06 19:46:36,996 INFO L226 Difference]: Without dead ends: 62282 [2021-01-06 19:46:37,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62282 states. [2021-01-06 19:46:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62282 to 59356. [2021-01-06 19:46:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59356 states. [2021-01-06 19:46:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59356 states to 59356 states and 83561 transitions. [2021-01-06 19:46:40,031 INFO L78 Accepts]: Start accepts. Automaton has 59356 states and 83561 transitions. Word has length 98 [2021-01-06 19:46:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:40,031 INFO L481 AbstractCegarLoop]: Abstraction has 59356 states and 83561 transitions. [2021-01-06 19:46:40,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 59356 states and 83561 transitions. [2021-01-06 19:46:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:46:40,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:40,056 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:40,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:46:40,056 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1459061363, now seen corresponding path program 1 times [2021-01-06 19:46:40,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:40,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380400955] [2021-01-06 19:46:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:46:40,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380400955] [2021-01-06 19:46:40,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:40,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:40,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520604421] [2021-01-06 19:46:40,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:40,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:40,408 INFO L87 Difference]: Start difference. First operand 59356 states and 83561 transitions. Second operand 7 states. [2021-01-06 19:46:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:44,441 INFO L93 Difference]: Finished difference Result 115214 states and 164114 transitions. [2021-01-06 19:46:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:44,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2021-01-06 19:46:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:44,607 INFO L225 Difference]: With dead ends: 115214 [2021-01-06 19:46:44,608 INFO L226 Difference]: Without dead ends: 106764 [2021-01-06 19:46:44,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:46:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106764 states. [2021-01-06 19:46:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106764 to 67612. [2021-01-06 19:46:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67612 states. [2021-01-06 19:46:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67612 states to 67612 states and 95305 transitions. [2021-01-06 19:46:48,344 INFO L78 Accepts]: Start accepts. Automaton has 67612 states and 95305 transitions. Word has length 98 [2021-01-06 19:46:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:48,345 INFO L481 AbstractCegarLoop]: Abstraction has 67612 states and 95305 transitions. [2021-01-06 19:46:48,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 67612 states and 95305 transitions. [2021-01-06 19:46:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:46:48,365 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:48,365 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:48,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:46:48,366 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1675071005, now seen corresponding path program 1 times [2021-01-06 19:46:48,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:48,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30808982] [2021-01-06 19:46:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:46:48,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30808982] [2021-01-06 19:46:48,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:48,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:48,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865457548] [2021-01-06 19:46:48,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:48,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:48,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:48,497 INFO L87 Difference]: Start difference. First operand 67612 states and 95305 transitions. Second operand 7 states. [2021-01-06 19:46:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:53,708 INFO L93 Difference]: Finished difference Result 127601 states and 181810 transitions. [2021-01-06 19:46:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:46:53,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2021-01-06 19:46:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:53,861 INFO L225 Difference]: With dead ends: 127601 [2021-01-06 19:46:53,862 INFO L226 Difference]: Without dead ends: 114913 [2021-01-06 19:46:53,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:46:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114913 states. [2021-01-06 19:46:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114913 to 79972. [2021-01-06 19:46:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79972 states. [2021-01-06 19:46:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79972 states to 79972 states and 112857 transitions. [2021-01-06 19:46:58,257 INFO L78 Accepts]: Start accepts. Automaton has 79972 states and 112857 transitions. Word has length 98 [2021-01-06 19:46:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:58,257 INFO L481 AbstractCegarLoop]: Abstraction has 79972 states and 112857 transitions. [2021-01-06 19:46:58,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:46:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 79972 states and 112857 transitions. [2021-01-06 19:46:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:46:58,276 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:58,277 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:58,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:46:58,277 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:58,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1191506179, now seen corresponding path program 1 times [2021-01-06 19:46:58,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:58,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662928708] [2021-01-06 19:46:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:46:58,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662928708] [2021-01-06 19:46:58,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:58,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:46:58,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488654688] [2021-01-06 19:46:58,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:46:58,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:46:58,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:58,409 INFO L87 Difference]: Start difference. First operand 79972 states and 112857 transitions. Second operand 7 states. [2021-01-06 19:47:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:04,717 INFO L93 Difference]: Finished difference Result 151956 states and 216207 transitions. [2021-01-06 19:47:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:47:04,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2021-01-06 19:47:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:04,937 INFO L225 Difference]: With dead ends: 151956 [2021-01-06 19:47:04,937 INFO L226 Difference]: Without dead ends: 132131 [2021-01-06 19:47:04,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:47:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132131 states. [2021-01-06 19:47:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132131 to 96177. [2021-01-06 19:47:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96177 states. [2021-01-06 19:47:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96177 states to 96177 states and 135714 transitions. [2021-01-06 19:47:10,324 INFO L78 Accepts]: Start accepts. Automaton has 96177 states and 135714 transitions. Word has length 98 [2021-01-06 19:47:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:10,324 INFO L481 AbstractCegarLoop]: Abstraction has 96177 states and 135714 transitions. [2021-01-06 19:47:10,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:47:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 96177 states and 135714 transitions. [2021-01-06 19:47:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 19:47:10,343 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:10,343 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:10,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:47:10,344 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1676232259, now seen corresponding path program 1 times [2021-01-06 19:47:10,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:10,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563530534] [2021-01-06 19:47:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:10,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563530534] [2021-01-06 19:47:10,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882479146] [2021-01-06 19:47:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:47:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:10,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 19:47:10,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:47:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:47:11,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:47:11,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2021-01-06 19:47:11,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508169318] [2021-01-06 19:47:11,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 19:47:11,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 19:47:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:47:11,332 INFO L87 Difference]: Start difference. First operand 96177 states and 135714 transitions. Second operand 12 states. [2021-01-06 19:48:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:05,985 INFO L93 Difference]: Finished difference Result 972608 states and 1361932 transitions. [2021-01-06 19:48:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-01-06 19:48:05,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2021-01-06 19:48:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:48:08,359 INFO L225 Difference]: With dead ends: 972608 [2021-01-06 19:48:08,359 INFO L226 Difference]: Without dead ends: 876238 [2021-01-06 19:48:08,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1013, Invalid=4389, Unknown=0, NotChecked=0, Total=5402 [2021-01-06 19:48:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876238 states.