/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.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:50:07,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:50:07,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:50:08,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:50:08,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:50:08,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:50:08,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:50:08,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:50:08,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:50:08,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:50:08,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:50:08,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:50:08,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:50:08,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:50:08,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:50:08,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:50:08,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:50:08,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:50:08,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:50:08,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:50:08,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:50:08,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:50:08,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:50:08,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:50:08,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:50:08,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:50:08,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:50:08,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:50:08,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:50:08,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:50:08,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:50:08,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:50:08,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:50:08,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:50:08,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:50:08,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:50:08,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:50:08,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:50:08,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:50:08,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:50:08,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:50:08,144 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:50:08,171 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:50:08,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:50:08,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:50:08,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:50:08,173 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:50:08,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:50:08,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:50:08,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:50:08,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:50:08,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:50:08,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:50:08,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:50:08,175 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:50:08,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:50:08,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:50:08,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:50:08,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:50:08,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:50:08,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:50:08,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:50:08,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:50:08,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:50:08,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:50:08,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:50:08,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:50:08,178 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:50:08,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:50:08,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:50:08,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:50:08,628 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:50:08,629 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:50:08,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:50:08,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b9d31437a/ce86bb9246cd4ede9e570731c1d5b307/FLAG78ac84668 [2021-01-06 19:50:09,427 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:50:09,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:50:09,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b9d31437a/ce86bb9246cd4ede9e570731c1d5b307/FLAG78ac84668 [2021-01-06 19:50:09,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b9d31437a/ce86bb9246cd4ede9e570731c1d5b307 [2021-01-06 19:50:09,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:50:09,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:50:09,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:50:09,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:50:09,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:50:09,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:50:09" (1/1) ... [2021-01-06 19:50:09,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66cad491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:09, skipping insertion in model container [2021-01-06 19:50:09,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:50:09" (1/1) ... [2021-01-06 19:50:09,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:50:09,758 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[~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[~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[~mode2~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[~mode3~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[~mode4~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[~mode5~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~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~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[~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[~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[~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:50:10,053 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.5.ufo.BOUNDED-10.pals.c[11233,11246] [2021-01-06 19:50:10,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:50:10,079 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[~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[~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[~mode2~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[~mode3~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[~mode4~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[~mode5~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~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~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[~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[~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[~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:50:10,165 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.5.ufo.BOUNDED-10.pals.c[11233,11246] [2021-01-06 19:50:10,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:50:10,190 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:50:10,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10 WrapperNode [2021-01-06 19:50:10,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:50:10,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:50:10,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:50:10,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:50:10,202 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:50:10" (1/1) ... [2021-01-06 19:50:10,214 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:50:10" (1/1) ... [2021-01-06 19:50:10,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:50:10,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:50:10,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:50:10,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:50:10,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (1/1) ... [2021-01-06 19:50:10,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (1/1) ... [2021-01-06 19:50:10,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (1/1) ... [2021-01-06 19:50:10,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (1/1) ... [2021-01-06 19:50:10,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (1/1) ... [2021-01-06 19:50:10,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (1/1) ... [2021-01-06 19:50:10,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (1/1) ... [2021-01-06 19:50:10,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:50:10,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:50:10,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:50:10,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:50:10,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (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:50:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:50:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:50:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:50:10,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:50:11,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:50:11,334 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-01-06 19:50:11,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:50:11 BoogieIcfgContainer [2021-01-06 19:50:11,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:50:11,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:50:11,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:50:11,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:50:11,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:50:09" (1/3) ... [2021-01-06 19:50:11,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ea4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:50:11, skipping insertion in model container [2021-01-06 19:50:11,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:10" (2/3) ... [2021-01-06 19:50:11,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ea4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:50:11, skipping insertion in model container [2021-01-06 19:50:11,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:50:11" (3/3) ... [2021-01-06 19:50:11,357 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:50:11,371 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:50:11,378 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:50:11,405 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:50:11,472 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:50:11,472 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:50:11,473 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:50:11,473 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:50:11,473 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:50:11,473 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:50:11,473 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:50:11,473 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:50:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2021-01-06 19:50:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:50:11,531 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:11,532 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:50:11,533 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash 8392247, now seen corresponding path program 1 times [2021-01-06 19:50:11,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:11,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853369327] [2021-01-06 19:50:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:11,902 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:50:11,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853369327] [2021-01-06 19:50:11,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:11,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:50:11,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259739395] [2021-01-06 19:50:11,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:50:11,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:50:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:50:11,940 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2021-01-06 19:50:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:11,980 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2021-01-06 19:50:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:50:11,982 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2021-01-06 19:50:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:11,997 INFO L225 Difference]: With dead ends: 150 [2021-01-06 19:50:11,998 INFO L226 Difference]: Without dead ends: 89 [2021-01-06 19:50:12,002 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:50:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-06 19:50:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-01-06 19:50:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-06 19:50:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 150 transitions. [2021-01-06 19:50:12,056 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 150 transitions. Word has length 33 [2021-01-06 19:50:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:12,057 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 150 transitions. [2021-01-06 19:50:12,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:50:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2021-01-06 19:50:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:50:12,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:12,060 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:50:12,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:50:12,061 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash -501080843, now seen corresponding path program 1 times [2021-01-06 19:50:12,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:12,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089847472] [2021-01-06 19:50:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:12,276 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:50:12,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089847472] [2021-01-06 19:50:12,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:12,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:50:12,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419459683] [2021-01-06 19:50:12,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:50:12,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:50:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:50:12,283 INFO L87 Difference]: Start difference. First operand 89 states and 150 transitions. Second operand 5 states. [2021-01-06 19:50:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:12,456 INFO L93 Difference]: Finished difference Result 145 states and 236 transitions. [2021-01-06 19:50:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:50:12,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2021-01-06 19:50:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:12,463 INFO L225 Difference]: With dead ends: 145 [2021-01-06 19:50:12,463 INFO L226 Difference]: Without dead ends: 89 [2021-01-06 19:50:12,465 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:50:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-06 19:50:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-01-06 19:50:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-06 19:50:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2021-01-06 19:50:12,489 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 33 [2021-01-06 19:50:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:12,490 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2021-01-06 19:50:12,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:50:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2021-01-06 19:50:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:12,495 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:12,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:12,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:50:12,498 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash 988628396, now seen corresponding path program 1 times [2021-01-06 19:50:12,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:12,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639415366] [2021-01-06 19:50:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:12,759 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:50:12,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639415366] [2021-01-06 19:50:12,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:12,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:12,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448135430] [2021-01-06 19:50:12,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:12,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:12,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:12,765 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand 3 states. [2021-01-06 19:50:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:12,802 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2021-01-06 19:50:12,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:12,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:50:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:12,806 INFO L225 Difference]: With dead ends: 187 [2021-01-06 19:50:12,806 INFO L226 Difference]: Without dead ends: 135 [2021-01-06 19:50:12,807 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:50:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-01-06 19:50:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-01-06 19:50:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-01-06 19:50:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 189 transitions. [2021-01-06 19:50:12,827 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 189 transitions. Word has length 63 [2021-01-06 19:50:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:12,828 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 189 transitions. [2021-01-06 19:50:12,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 189 transitions. [2021-01-06 19:50:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:12,837 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:12,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:12,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:50:12,840 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash 243045666, now seen corresponding path program 1 times [2021-01-06 19:50:12,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:12,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394871425] [2021-01-06 19:50:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:12,980 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:50:12,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394871425] [2021-01-06 19:50:12,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:12,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:12,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544039486] [2021-01-06 19:50:12,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:12,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:12,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:12,984 INFO L87 Difference]: Start difference. First operand 133 states and 189 transitions. Second operand 3 states. [2021-01-06 19:50:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:13,013 INFO L93 Difference]: Finished difference Result 313 states and 473 transitions. [2021-01-06 19:50:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:13,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:50:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:13,017 INFO L225 Difference]: With dead ends: 313 [2021-01-06 19:50:13,017 INFO L226 Difference]: Without dead ends: 217 [2021-01-06 19:50:13,018 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:50:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-06 19:50:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2021-01-06 19:50:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 19:50:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 318 transitions. [2021-01-06 19:50:13,059 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 318 transitions. Word has length 63 [2021-01-06 19:50:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:13,059 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 318 transitions. [2021-01-06 19:50:13,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 318 transitions. [2021-01-06 19:50:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:13,064 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:13,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:13,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:50:13,064 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1696985192, now seen corresponding path program 1 times [2021-01-06 19:50:13,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:13,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714852107] [2021-01-06 19:50:13,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:13,186 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:50:13,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714852107] [2021-01-06 19:50:13,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:13,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:13,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622769250] [2021-01-06 19:50:13,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:13,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:13,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:13,192 INFO L87 Difference]: Start difference. First operand 215 states and 318 transitions. Second operand 3 states. [2021-01-06 19:50:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:13,251 INFO L93 Difference]: Finished difference Result 547 states and 840 transitions. [2021-01-06 19:50:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:13,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:50:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:13,259 INFO L225 Difference]: With dead ends: 547 [2021-01-06 19:50:13,259 INFO L226 Difference]: Without dead ends: 369 [2021-01-06 19:50:13,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-01-06 19:50:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2021-01-06 19:50:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2021-01-06 19:50:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 554 transitions. [2021-01-06 19:50:13,313 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 554 transitions. Word has length 63 [2021-01-06 19:50:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:13,313 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 554 transitions. [2021-01-06 19:50:13,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 554 transitions. [2021-01-06 19:50:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:13,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:13,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:13,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:50:13,318 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1003697422, now seen corresponding path program 1 times [2021-01-06 19:50:13,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:13,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605251046] [2021-01-06 19:50:13,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:13,446 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:50:13,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605251046] [2021-01-06 19:50:13,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:13,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:13,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274807604] [2021-01-06 19:50:13,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:13,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:13,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:13,451 INFO L87 Difference]: Start difference. First operand 367 states and 554 transitions. Second operand 3 states. [2021-01-06 19:50:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:13,510 INFO L93 Difference]: Finished difference Result 979 states and 1508 transitions. [2021-01-06 19:50:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:13,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:50:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:13,515 INFO L225 Difference]: With dead ends: 979 [2021-01-06 19:50:13,515 INFO L226 Difference]: Without dead ends: 649 [2021-01-06 19:50:13,517 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:50:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-01-06 19:50:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2021-01-06 19:50:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2021-01-06 19:50:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 982 transitions. [2021-01-06 19:50:13,552 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 982 transitions. Word has length 63 [2021-01-06 19:50:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:13,552 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 982 transitions. [2021-01-06 19:50:13,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 982 transitions. [2021-01-06 19:50:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:13,554 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:13,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:13,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:50:13,554 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1341490564, now seen corresponding path program 1 times [2021-01-06 19:50:13,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:13,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791496943] [2021-01-06 19:50:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:13,663 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:50:13,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791496943] [2021-01-06 19:50:13,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:13,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:13,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281134083] [2021-01-06 19:50:13,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:13,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:13,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:13,667 INFO L87 Difference]: Start difference. First operand 647 states and 982 transitions. Second operand 3 states. [2021-01-06 19:50:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:13,726 INFO L93 Difference]: Finished difference Result 1771 states and 2712 transitions. [2021-01-06 19:50:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:13,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:50:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:13,734 INFO L225 Difference]: With dead ends: 1771 [2021-01-06 19:50:13,734 INFO L226 Difference]: Without dead ends: 1161 [2021-01-06 19:50:13,736 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:50:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2021-01-06 19:50:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1159. [2021-01-06 19:50:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2021-01-06 19:50:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1750 transitions. [2021-01-06 19:50:13,798 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1750 transitions. Word has length 63 [2021-01-06 19:50:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:13,798 INFO L481 AbstractCegarLoop]: Abstraction has 1159 states and 1750 transitions. [2021-01-06 19:50:13,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1750 transitions. [2021-01-06 19:50:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:13,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:13,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:13,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:50:13,800 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1735491334, now seen corresponding path program 1 times [2021-01-06 19:50:13,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:13,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294577197] [2021-01-06 19:50:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:13,911 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:50:13,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294577197] [2021-01-06 19:50:13,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:13,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:13,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841537367] [2021-01-06 19:50:13,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:13,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:13,914 INFO L87 Difference]: Start difference. First operand 1159 states and 1750 transitions. Second operand 7 states. [2021-01-06 19:50:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:14,552 INFO L93 Difference]: Finished difference Result 12379 states and 18880 transitions. [2021-01-06 19:50:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:50:14,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2021-01-06 19:50:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:14,635 INFO L225 Difference]: With dead ends: 12379 [2021-01-06 19:50:14,636 INFO L226 Difference]: Without dead ends: 11257 [2021-01-06 19:50:14,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:50:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11257 states. [2021-01-06 19:50:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11257 to 2279. [2021-01-06 19:50:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2021-01-06 19:50:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3398 transitions. [2021-01-06 19:50:14,893 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3398 transitions. Word has length 63 [2021-01-06 19:50:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:14,895 INFO L481 AbstractCegarLoop]: Abstraction has 2279 states and 3398 transitions. [2021-01-06 19:50:14,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3398 transitions. [2021-01-06 19:50:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:50:14,896 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:14,896 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:50:14,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:50:14,896 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1519410410, now seen corresponding path program 1 times [2021-01-06 19:50:14,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:14,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846890903] [2021-01-06 19:50:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:14,993 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:50:14,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846890903] [2021-01-06 19:50:14,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:14,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:15,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401950509] [2021-01-06 19:50:15,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:15,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:15,002 INFO L87 Difference]: Start difference. First operand 2279 states and 3398 transitions. Second operand 3 states. [2021-01-06 19:50:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:15,269 INFO L93 Difference]: Finished difference Result 5565 states and 8314 transitions. [2021-01-06 19:50:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:15,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:50:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:15,286 INFO L225 Difference]: With dead ends: 5565 [2021-01-06 19:50:15,287 INFO L226 Difference]: Without dead ends: 3323 [2021-01-06 19:50:15,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2021-01-06 19:50:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3321. [2021-01-06 19:50:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2021-01-06 19:50:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4904 transitions. [2021-01-06 19:50:15,530 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4904 transitions. Word has length 65 [2021-01-06 19:50:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:15,530 INFO L481 AbstractCegarLoop]: Abstraction has 3321 states and 4904 transitions. [2021-01-06 19:50:15,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4904 transitions. [2021-01-06 19:50:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:50:15,531 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:15,532 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:50:15,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:50:15,532 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1585903922, now seen corresponding path program 1 times [2021-01-06 19:50:15,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:15,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341874566] [2021-01-06 19:50:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:15,849 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:50:15,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341874566] [2021-01-06 19:50:15,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:15,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:15,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930702062] [2021-01-06 19:50:15,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:15,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:15,852 INFO L87 Difference]: Start difference. First operand 3321 states and 4904 transitions. Second operand 7 states. [2021-01-06 19:50:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:16,279 INFO L93 Difference]: Finished difference Result 6605 states and 9770 transitions. [2021-01-06 19:50:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:16,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2021-01-06 19:50:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:16,299 INFO L225 Difference]: With dead ends: 6605 [2021-01-06 19:50:16,300 INFO L226 Difference]: Without dead ends: 3323 [2021-01-06 19:50:16,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:50:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2021-01-06 19:50:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3321. [2021-01-06 19:50:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2021-01-06 19:50:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4856 transitions. [2021-01-06 19:50:16,520 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4856 transitions. Word has length 65 [2021-01-06 19:50:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:16,521 INFO L481 AbstractCegarLoop]: Abstraction has 3321 states and 4856 transitions. [2021-01-06 19:50:16,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4856 transitions. [2021-01-06 19:50:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:50:16,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:16,522 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:50:16,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:50:16,522 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1503658279, now seen corresponding path program 1 times [2021-01-06 19:50:16,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:16,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298875450] [2021-01-06 19:50:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:16,672 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:50:16,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298875450] [2021-01-06 19:50:16,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:16,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:50:16,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670939793] [2021-01-06 19:50:16,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:50:16,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:50:16,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:50:16,677 INFO L87 Difference]: Start difference. First operand 3321 states and 4856 transitions. Second operand 8 states. [2021-01-06 19:50:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:17,221 INFO L93 Difference]: Finished difference Result 6164 states and 8906 transitions. [2021-01-06 19:50:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:50:17,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2021-01-06 19:50:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:17,271 INFO L225 Difference]: With dead ends: 6164 [2021-01-06 19:50:17,271 INFO L226 Difference]: Without dead ends: 6162 [2021-01-06 19:50:17,274 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:50:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2021-01-06 19:50:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 3513. [2021-01-06 19:50:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3513 states. [2021-01-06 19:50:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 5032 transitions. [2021-01-06 19:50:17,582 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 5032 transitions. Word has length 66 [2021-01-06 19:50:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:17,583 INFO L481 AbstractCegarLoop]: Abstraction has 3513 states and 5032 transitions. [2021-01-06 19:50:17,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:50:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5032 transitions. [2021-01-06 19:50:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:50:17,586 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:17,587 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:50:17,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:50:17,587 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 550206538, now seen corresponding path program 1 times [2021-01-06 19:50:17,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:17,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482552255] [2021-01-06 19:50:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:50:17,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482552255] [2021-01-06 19:50:17,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:17,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:17,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958488018] [2021-01-06 19:50:17,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:17,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:17,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:17,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:17,755 INFO L87 Difference]: Start difference. First operand 3513 states and 5032 transitions. Second operand 7 states. [2021-01-06 19:50:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:18,978 INFO L93 Difference]: Finished difference Result 21589 states and 30958 transitions. [2021-01-06 19:50:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:18,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2021-01-06 19:50:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:19,018 INFO L225 Difference]: With dead ends: 21589 [2021-01-06 19:50:19,019 INFO L226 Difference]: Without dead ends: 18115 [2021-01-06 19:50:19,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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:50:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18115 states. [2021-01-06 19:50:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18115 to 6985. [2021-01-06 19:50:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6985 states. [2021-01-06 19:50:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 9976 transitions. [2021-01-06 19:50:19,739 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 9976 transitions. Word has length 94 [2021-01-06 19:50:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:19,740 INFO L481 AbstractCegarLoop]: Abstraction has 6985 states and 9976 transitions. [2021-01-06 19:50:19,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 9976 transitions. [2021-01-06 19:50:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:50:19,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:19,745 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:50:19,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:50:19,745 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:19,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1218576278, now seen corresponding path program 1 times [2021-01-06 19:50:19,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:19,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107472121] [2021-01-06 19:50:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:50:19,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107472121] [2021-01-06 19:50:19,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:19,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:19,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558327420] [2021-01-06 19:50:19,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:19,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:19,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:19,886 INFO L87 Difference]: Start difference. First operand 6985 states and 9976 transitions. Second operand 7 states. [2021-01-06 19:50:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:21,217 INFO L93 Difference]: Finished difference Result 25061 states and 35902 transitions. [2021-01-06 19:50:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:21,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2021-01-06 19:50:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:21,266 INFO L225 Difference]: With dead ends: 25061 [2021-01-06 19:50:21,267 INFO L226 Difference]: Without dead ends: 21587 [2021-01-06 19:50:21,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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:50:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21587 states. [2021-01-06 19:50:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21587 to 12201. [2021-01-06 19:50:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12201 states. [2021-01-06 19:50:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12201 states to 12201 states and 17352 transitions. [2021-01-06 19:50:22,163 INFO L78 Accepts]: Start accepts. Automaton has 12201 states and 17352 transitions. Word has length 94 [2021-01-06 19:50:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:22,164 INFO L481 AbstractCegarLoop]: Abstraction has 12201 states and 17352 transitions. [2021-01-06 19:50:22,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12201 states and 17352 transitions. [2021-01-06 19:50:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:50:22,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:22,170 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:50:22,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:50:22,170 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:22,171 INFO L82 PathProgramCache]: Analyzing trace with hash -86936438, now seen corresponding path program 1 times [2021-01-06 19:50:22,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:22,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215526001] [2021-01-06 19:50:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:50:22,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215526001] [2021-01-06 19:50:22,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:22,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:22,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184497667] [2021-01-06 19:50:22,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:22,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:22,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:22,314 INFO L87 Difference]: Start difference. First operand 12201 states and 17352 transitions. Second operand 7 states. [2021-01-06 19:50:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:23,642 INFO L93 Difference]: Finished difference Result 28533 states and 40846 transitions. [2021-01-06 19:50:23,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:23,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2021-01-06 19:50:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:23,698 INFO L225 Difference]: With dead ends: 28533 [2021-01-06 19:50:23,698 INFO L226 Difference]: Without dead ends: 25059 [2021-01-06 19:50:23,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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:50:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25059 states. [2021-01-06 19:50:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25059 to 15673. [2021-01-06 19:50:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15673 states. [2021-01-06 19:50:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15673 states to 15673 states and 22296 transitions. [2021-01-06 19:50:24,784 INFO L78 Accepts]: Start accepts. Automaton has 15673 states and 22296 transitions. Word has length 94 [2021-01-06 19:50:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:24,785 INFO L481 AbstractCegarLoop]: Abstraction has 15673 states and 22296 transitions. [2021-01-06 19:50:24,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15673 states and 22296 transitions. [2021-01-06 19:50:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:50:24,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:24,790 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:50:24,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:50:24,790 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1322395478, now seen corresponding path program 1 times [2021-01-06 19:50:24,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:24,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140851264] [2021-01-06 19:50:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:50:24,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140851264] [2021-01-06 19:50:24,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:24,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:24,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203053362] [2021-01-06 19:50:24,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:24,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:24,905 INFO L87 Difference]: Start difference. First operand 15673 states and 22296 transitions. Second operand 7 states. [2021-01-06 19:50:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:26,449 INFO L93 Difference]: Finished difference Result 32005 states and 45790 transitions. [2021-01-06 19:50:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:26,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2021-01-06 19:50:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:26,514 INFO L225 Difference]: With dead ends: 32005 [2021-01-06 19:50:26,514 INFO L226 Difference]: Without dead ends: 28531 [2021-01-06 19:50:26,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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:50:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28531 states. [2021-01-06 19:50:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28531 to 19145. [2021-01-06 19:50:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19145 states. [2021-01-06 19:50:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19145 states to 19145 states and 27240 transitions. [2021-01-06 19:50:27,855 INFO L78 Accepts]: Start accepts. Automaton has 19145 states and 27240 transitions. Word has length 94 [2021-01-06 19:50:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:27,855 INFO L481 AbstractCegarLoop]: Abstraction has 19145 states and 27240 transitions. [2021-01-06 19:50:27,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 19145 states and 27240 transitions. [2021-01-06 19:50:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:50:27,870 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:27,870 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:50:27,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:50:27,870 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1551576266, now seen corresponding path program 1 times [2021-01-06 19:50:27,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:27,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972111568] [2021-01-06 19:50:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:50:27,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972111568] [2021-01-06 19:50:27,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:27,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:27,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301238964] [2021-01-06 19:50:27,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:27,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:27,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:27,987 INFO L87 Difference]: Start difference. First operand 19145 states and 27240 transitions. Second operand 7 states. [2021-01-06 19:50:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:29,610 INFO L93 Difference]: Finished difference Result 33397 states and 47790 transitions. [2021-01-06 19:50:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:29,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2021-01-06 19:50:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:29,656 INFO L225 Difference]: With dead ends: 33397 [2021-01-06 19:50:29,656 INFO L226 Difference]: Without dead ends: 30963 [2021-01-06 19:50:29,668 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:50:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30963 states. [2021-01-06 19:50:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30963 to 21577. [2021-01-06 19:50:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21577 states. [2021-01-06 19:50:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 30728 transitions. [2021-01-06 19:50:31,248 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 30728 transitions. Word has length 94 [2021-01-06 19:50:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:31,248 INFO L481 AbstractCegarLoop]: Abstraction has 21577 states and 30728 transitions. [2021-01-06 19:50:31,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 30728 transitions. [2021-01-06 19:50:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:50:31,255 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:31,255 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] [2021-01-06 19:50:31,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:50:31,256 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:31,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1418973216, now seen corresponding path program 1 times [2021-01-06 19:50:31,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:31,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452104480] [2021-01-06 19:50:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:50:31,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452104480] [2021-01-06 19:50:31,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653832997] [2021-01-06 19:50:31,426 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:50:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:31,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-06 19:50:31,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:50:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:50:31,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:50:31,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2021-01-06 19:50:31,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51480799] [2021-01-06 19:50:31,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:31,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:31,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:31,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:31,930 INFO L87 Difference]: Start difference. First operand 21577 states and 30728 transitions. Second operand 7 states. [2021-01-06 19:50:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:34,910 INFO L93 Difference]: Finished difference Result 51370 states and 73576 transitions. [2021-01-06 19:50:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:50:34,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2021-01-06 19:50:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:34,971 INFO L225 Difference]: With dead ends: 51370 [2021-01-06 19:50:34,971 INFO L226 Difference]: Without dead ends: 35560 [2021-01-06 19:50:35,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:50:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35560 states. [2021-01-06 19:50:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35560 to 35033. [2021-01-06 19:50:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35033 states. [2021-01-06 19:50:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35033 states to 35033 states and 49544 transitions. [2021-01-06 19:50:37,352 INFO L78 Accepts]: Start accepts. Automaton has 35033 states and 49544 transitions. Word has length 95 [2021-01-06 19:50:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:37,353 INFO L481 AbstractCegarLoop]: Abstraction has 35033 states and 49544 transitions. [2021-01-06 19:50:37,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 35033 states and 49544 transitions. [2021-01-06 19:50:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 19:50:37,360 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:37,360 INFO L422 BasicCegarLoop]: trace histogram [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:50:37,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 19:50:37,574 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash -881696638, now seen corresponding path program 1 times [2021-01-06 19:50:37,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:37,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649726839] [2021-01-06 19:50:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:50:37,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649726839] [2021-01-06 19:50:37,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167476515] [2021-01-06 19:50:37,848 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:50:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:38,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:50:38,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:50:38,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:50:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:50:38,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:50:38,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-01-06 19:50:38,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571181965] [2021-01-06 19:50:38,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 19:50:38,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 19:50:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:50:38,528 INFO L87 Difference]: Start difference. First operand 35033 states and 49544 transitions. Second operand 17 states. [2021-01-06 19:51:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:15,310 INFO L93 Difference]: Finished difference Result 446745 states and 621650 transitions. [2021-01-06 19:51:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2021-01-06 19:51:15,310 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2021-01-06 19:51:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:16,186 INFO L225 Difference]: With dead ends: 446745 [2021-01-06 19:51:16,186 INFO L226 Difference]: Without dead ends: 411751 [2021-01-06 19:51:16,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7040 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2549, Invalid=15541, Unknown=0, NotChecked=0, Total=18090 [2021-01-06 19:51:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411751 states. [2021-01-06 19:51:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411751 to 163293. [2021-01-06 19:51:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163293 states. [2021-01-06 19:51:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163293 states to 163293 states and 228080 transitions. [2021-01-06 19:51:31,259 INFO L78 Accepts]: Start accepts. Automaton has 163293 states and 228080 transitions. Word has length 96 [2021-01-06 19:51:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:31,259 INFO L481 AbstractCegarLoop]: Abstraction has 163293 states and 228080 transitions. [2021-01-06 19:51:31,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 19:51:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 163293 states and 228080 transitions. [2021-01-06 19:51:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 19:51:31,271 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:31,271 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:51:31,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 19:51:31,485 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:31,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1531112692, now seen corresponding path program 1 times [2021-01-06 19:51:31,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:31,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267843945] [2021-01-06 19:51:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:31,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267843945] [2021-01-06 19:51:31,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742035513] [2021-01-06 19:51:31,991 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:51:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:32,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:51:32,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:51:32,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:51:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:32,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:51:32,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-01-06 19:51:32,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064327330] [2021-01-06 19:51:32,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 19:51:32,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:32,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 19:51:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:51:32,662 INFO L87 Difference]: Start difference. First operand 163293 states and 228080 transitions. Second operand 17 states. [2021-01-06 19:51:33,424 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-01-06 19:51:46,937 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2021-01-06 19:51:47,365 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50