/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.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:50:36,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:50:36,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:50:36,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:50:36,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:50:36,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:50:36,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:50:36,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:50:36,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:50:36,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:50:36,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:50:36,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:50:36,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:50:36,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:50:36,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:50:36,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:50:36,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:50:36,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:50:36,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:50:36,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:50:36,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:50:36,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:50:36,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:50:36,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:50:36,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:50:36,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:50:36,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:50:36,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:50:36,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:50:36,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:50:36,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:50:36,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:50:36,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:50:36,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:50:36,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:50:36,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:50:36,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:50:36,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:50:36,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:50:36,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:50:36,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:50:36,257 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:36,304 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:50:36,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:50:36,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:50:36,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:50:36,307 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:50:36,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:50:36,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:50:36,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:50:36,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:50:36,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:50:36,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:50:36,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:50:36,309 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:50:36,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:50:36,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:50:36,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:50:36,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:50:36,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:50:36,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:50:36,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:50:36,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:50:36,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:50:36,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:50:36,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:50:36,311 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:50:36,311 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:36,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:50:36,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:50:36,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:50:36,765 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:50:36,765 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:50:36,766 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.UNBOUNDED.pals.c [2021-01-06 19:50:36,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ddfcbc1d5/6787177a126c41af832363b2a28b60f1/FLAGe88e9ced4 [2021-01-06 19:50:37,608 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:50:37,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c [2021-01-06 19:50:37,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ddfcbc1d5/6787177a126c41af832363b2a28b60f1/FLAGe88e9ced4 [2021-01-06 19:50:37,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ddfcbc1d5/6787177a126c41af832363b2a28b60f1 [2021-01-06 19:50:37,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:50:37,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:50:37,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:50:37,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:50:37,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:50:37,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:50:37" (1/1) ... [2021-01-06 19:50:37,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f66dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:37, skipping insertion in model container [2021-01-06 19:50:37,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:50:37" (1/1) ... [2021-01-06 19:50:37,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:50:38,050 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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:38,289 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.UNBOUNDED.pals.c[11261,11274] [2021-01-06 19:50:38,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:50:38,304 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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:38,408 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c[11261,11274] [2021-01-06 19:50:38,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:50:38,433 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:50:38,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:38 WrapperNode [2021-01-06 19:50:38,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:50:38,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:50:38,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:50:38,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:50:38,445 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:38" (1/1) ... [2021-01-06 19:50:38,457 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:38" (1/1) ... [2021-01-06 19:50:38,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:50:38,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:50:38,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:50:38,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:50:38,529 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:38" (1/1) ... [2021-01-06 19:50:38,529 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:38" (1/1) ... [2021-01-06 19:50:38,543 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:38" (1/1) ... [2021-01-06 19:50:38,546 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:38" (1/1) ... [2021-01-06 19:50:38,566 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:38" (1/1) ... [2021-01-06 19:50:38,589 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:38" (1/1) ... [2021-01-06 19:50:38,595 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:38" (1/1) ... [2021-01-06 19:50:38,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:50:38,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:50:38,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:50:38,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:50:38,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:38" (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:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:50:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:50:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:50:38,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:50:39,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:50:39,639 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-01-06 19:50:39,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:50:39 BoogieIcfgContainer [2021-01-06 19:50:39,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:50:39,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:50:39,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:50:39,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:50:39,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:50:37" (1/3) ... [2021-01-06 19:50:39,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdd3153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:50:39, skipping insertion in model container [2021-01-06 19:50:39,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:50:38" (2/3) ... [2021-01-06 19:50:39,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdd3153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:50:39, skipping insertion in model container [2021-01-06 19:50:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:50:39" (3/3) ... [2021-01-06 19:50:39,662 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c [2021-01-06 19:50:39,669 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:50:39,675 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:50:39,701 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:50:39,749 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:50:39,750 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:50:39,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:50:39,750 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:50:39,751 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:50:39,751 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:50:39,751 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:50:39,751 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:50:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2021-01-06 19:50:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:50:39,792 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:39,793 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:39,793 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:39,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -176333024, now seen corresponding path program 1 times [2021-01-06 19:50:39,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:39,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268537655] [2021-01-06 19:50:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:40,149 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:40,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268537655] [2021-01-06 19:50:40,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:40,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:50:40,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950274442] [2021-01-06 19:50:40,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:50:40,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:40,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:50:40,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:50:40,176 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2021-01-06 19:50:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:40,206 INFO L93 Difference]: Finished difference Result 148 states and 247 transitions. [2021-01-06 19:50:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:50:40,208 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2021-01-06 19:50:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:40,220 INFO L225 Difference]: With dead ends: 148 [2021-01-06 19:50:40,221 INFO L226 Difference]: Without dead ends: 90 [2021-01-06 19:50:40,227 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:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-01-06 19:50:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-01-06 19:50:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-06 19:50:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 152 transitions. [2021-01-06 19:50:40,276 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 152 transitions. Word has length 33 [2021-01-06 19:50:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:40,277 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 152 transitions. [2021-01-06 19:50:40,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:50:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 152 transitions. [2021-01-06 19:50:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:50:40,279 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:40,279 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:40,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:50:40,280 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash -685806114, now seen corresponding path program 1 times [2021-01-06 19:50:40,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:40,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567836513] [2021-01-06 19:50:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:40,390 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:40,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567836513] [2021-01-06 19:50:40,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:40,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:50:40,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358854481] [2021-01-06 19:50:40,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:50:40,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:40,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:50:40,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:50:40,394 INFO L87 Difference]: Start difference. First operand 90 states and 152 transitions. Second operand 5 states. [2021-01-06 19:50:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:40,491 INFO L93 Difference]: Finished difference Result 147 states and 240 transitions. [2021-01-06 19:50:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:50:40,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2021-01-06 19:50:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:40,494 INFO L225 Difference]: With dead ends: 147 [2021-01-06 19:50:40,494 INFO L226 Difference]: Without dead ends: 90 [2021-01-06 19:50:40,495 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:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-01-06 19:50:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-01-06 19:50:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-06 19:50:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2021-01-06 19:50:40,506 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 33 [2021-01-06 19:50:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:40,506 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2021-01-06 19:50:40,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:50:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2021-01-06 19:50:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:40,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:40,509 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:40,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:50:40,510 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash 803903125, now seen corresponding path program 1 times [2021-01-06 19:50:40,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:40,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089462687] [2021-01-06 19:50:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:40,675 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:40,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089462687] [2021-01-06 19:50:40,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:40,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:40,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963373329] [2021-01-06 19:50:40,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:40,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:40,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:40,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:40,682 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand 3 states. [2021-01-06 19:50:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:40,732 INFO L93 Difference]: Finished difference Result 190 states and 279 transitions. [2021-01-06 19:50:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:40,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:50:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:40,737 INFO L225 Difference]: With dead ends: 190 [2021-01-06 19:50:40,737 INFO L226 Difference]: Without dead ends: 137 [2021-01-06 19:50:40,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-01-06 19:50:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-01-06 19:50:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-01-06 19:50:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2021-01-06 19:50:40,762 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 63 [2021-01-06 19:50:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:40,763 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2021-01-06 19:50:40,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2021-01-06 19:50:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:40,766 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:40,767 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:40,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:50:40,767 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1136127733, now seen corresponding path program 1 times [2021-01-06 19:50:40,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:40,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106839008] [2021-01-06 19:50:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:40,952 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:40,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106839008] [2021-01-06 19:50:40,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:40,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:40,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5426075] [2021-01-06 19:50:40,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:40,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:40,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:40,956 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand 3 states. [2021-01-06 19:50:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:40,984 INFO L93 Difference]: Finished difference Result 319 states and 485 transitions. [2021-01-06 19:50:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:40,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:50:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:40,992 INFO L225 Difference]: With dead ends: 319 [2021-01-06 19:50:40,992 INFO L226 Difference]: Without dead ends: 221 [2021-01-06 19:50:40,993 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:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-01-06 19:50:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2021-01-06 19:50:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-01-06 19:50:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 326 transitions. [2021-01-06 19:50:41,019 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 326 transitions. Word has length 63 [2021-01-06 19:50:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:41,019 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 326 transitions. [2021-01-06 19:50:41,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2021-01-06 19:50:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:50:41,021 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:41,022 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:41,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:50:41,022 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:41,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1564554881, now seen corresponding path program 1 times [2021-01-06 19:50:41,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:41,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110254602] [2021-01-06 19:50:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:41,252 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:41,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110254602] [2021-01-06 19:50:41,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:41,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:41,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128076511] [2021-01-06 19:50:41,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:41,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:41,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:41,256 INFO L87 Difference]: Start difference. First operand 219 states and 326 transitions. Second operand 7 states. [2021-01-06 19:50:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:41,609 INFO L93 Difference]: Finished difference Result 2039 states and 3216 transitions. [2021-01-06 19:50:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:50:41,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2021-01-06 19:50:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:41,625 INFO L225 Difference]: With dead ends: 2039 [2021-01-06 19:50:41,625 INFO L226 Difference]: Without dead ends: 1857 [2021-01-06 19:50:41,629 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:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2021-01-06 19:50:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 399. [2021-01-06 19:50:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2021-01-06 19:50:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 606 transitions. [2021-01-06 19:50:41,708 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 606 transitions. Word has length 63 [2021-01-06 19:50:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:41,711 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 606 transitions. [2021-01-06 19:50:41,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 606 transitions. [2021-01-06 19:50:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:50:41,719 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:41,720 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:41,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:50:41,720 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1117008495, now seen corresponding path program 1 times [2021-01-06 19:50:41,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:41,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707665678] [2021-01-06 19:50:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:41,888 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:41,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707665678] [2021-01-06 19:50:41,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:41,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:41,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795466978] [2021-01-06 19:50:41,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:41,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:41,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:41,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:41,891 INFO L87 Difference]: Start difference. First operand 399 states and 606 transitions. Second operand 3 states. [2021-01-06 19:50:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:41,945 INFO L93 Difference]: Finished difference Result 1079 states and 1668 transitions. [2021-01-06 19:50:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:41,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:50:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:41,950 INFO L225 Difference]: With dead ends: 1079 [2021-01-06 19:50:41,950 INFO L226 Difference]: Without dead ends: 717 [2021-01-06 19:50:41,952 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:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-01-06 19:50:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2021-01-06 19:50:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2021-01-06 19:50:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1070 transitions. [2021-01-06 19:50:41,991 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1070 transitions. Word has length 65 [2021-01-06 19:50:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:41,992 INFO L481 AbstractCegarLoop]: Abstraction has 707 states and 1070 transitions. [2021-01-06 19:50:41,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1070 transitions. [2021-01-06 19:50:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:50:41,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:41,993 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:41,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:50:41,994 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1050514983, now seen corresponding path program 1 times [2021-01-06 19:50:41,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:41,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744203140] [2021-01-06 19:50:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:42,268 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:42,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744203140] [2021-01-06 19:50:42,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:42,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:42,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345308549] [2021-01-06 19:50:42,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:42,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:42,276 INFO L87 Difference]: Start difference. First operand 707 states and 1070 transitions. Second operand 7 states. [2021-01-06 19:50:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:42,485 INFO L93 Difference]: Finished difference Result 1379 states and 2104 transitions. [2021-01-06 19:50:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:42,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2021-01-06 19:50:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:42,489 INFO L225 Difference]: With dead ends: 1379 [2021-01-06 19:50:42,490 INFO L226 Difference]: Without dead ends: 709 [2021-01-06 19:50:42,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:50:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-01-06 19:50:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 707. [2021-01-06 19:50:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2021-01-06 19:50:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1062 transitions. [2021-01-06 19:50:42,532 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1062 transitions. Word has length 65 [2021-01-06 19:50:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:42,534 INFO L481 AbstractCegarLoop]: Abstraction has 707 states and 1062 transitions. [2021-01-06 19:50:42,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1062 transitions. [2021-01-06 19:50:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:50:42,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:42,535 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:42,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:50:42,535 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:42,536 INFO L82 PathProgramCache]: Analyzing trace with hash 738399093, now seen corresponding path program 1 times [2021-01-06 19:50:42,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:42,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088418133] [2021-01-06 19:50:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:42,594 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:42,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088418133] [2021-01-06 19:50:42,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:42,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:42,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123793017] [2021-01-06 19:50:42,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:42,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:42,597 INFO L87 Difference]: Start difference. First operand 707 states and 1062 transitions. Second operand 3 states. [2021-01-06 19:50:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:42,670 INFO L93 Difference]: Finished difference Result 1951 states and 2952 transitions. [2021-01-06 19:50:42,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:42,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:50:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:42,677 INFO L225 Difference]: With dead ends: 1951 [2021-01-06 19:50:42,678 INFO L226 Difference]: Without dead ends: 1281 [2021-01-06 19:50:42,679 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:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2021-01-06 19:50:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1279. [2021-01-06 19:50:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2021-01-06 19:50:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1910 transitions. [2021-01-06 19:50:42,773 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1910 transitions. Word has length 65 [2021-01-06 19:50:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:42,773 INFO L481 AbstractCegarLoop]: Abstraction has 1279 states and 1910 transitions. [2021-01-06 19:50:42,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1910 transitions. [2021-01-06 19:50:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:50:42,774 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:42,774 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:42,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:50:42,775 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1985906709, now seen corresponding path program 1 times [2021-01-06 19:50:42,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:42,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880717896] [2021-01-06 19:50:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:42,858 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:42,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880717896] [2021-01-06 19:50:42,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:42,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:42,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90735745] [2021-01-06 19:50:42,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:42,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:42,868 INFO L87 Difference]: Start difference. First operand 1279 states and 1910 transitions. Second operand 3 states. [2021-01-06 19:50:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:43,014 INFO L93 Difference]: Finished difference Result 3571 states and 5336 transitions. [2021-01-06 19:50:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:43,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:50:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:43,027 INFO L225 Difference]: With dead ends: 3571 [2021-01-06 19:50:43,027 INFO L226 Difference]: Without dead ends: 2329 [2021-01-06 19:50:43,030 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:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2021-01-06 19:50:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2327. [2021-01-06 19:50:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2021-01-06 19:50:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3430 transitions. [2021-01-06 19:50:43,179 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3430 transitions. Word has length 65 [2021-01-06 19:50:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:43,179 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 3430 transitions. [2021-01-06 19:50:43,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3430 transitions. [2021-01-06 19:50:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:50:43,183 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:43,183 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:43,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:50:43,184 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:43,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1379050855, now seen corresponding path program 1 times [2021-01-06 19:50:43,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:43,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38097141] [2021-01-06 19:50:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:43,312 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:43,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38097141] [2021-01-06 19:50:43,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:43,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:50:43,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333132544] [2021-01-06 19:50:43,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:50:43,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:50:43,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:50:43,315 INFO L87 Difference]: Start difference. First operand 2327 states and 3430 transitions. Second operand 8 states. [2021-01-06 19:50:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:43,697 INFO L93 Difference]: Finished difference Result 4053 states and 5932 transitions. [2021-01-06 19:50:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:50:43,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2021-01-06 19:50:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:43,727 INFO L225 Difference]: With dead ends: 4053 [2021-01-06 19:50:43,727 INFO L226 Difference]: Without dead ends: 4051 [2021-01-06 19:50:43,732 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:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2021-01-06 19:50:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 2423. [2021-01-06 19:50:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2021-01-06 19:50:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3510 transitions. [2021-01-06 19:50:43,978 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3510 transitions. Word has length 66 [2021-01-06 19:50:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:43,978 INFO L481 AbstractCegarLoop]: Abstraction has 2423 states and 3510 transitions. [2021-01-06 19:50:43,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:50:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3510 transitions. [2021-01-06 19:50:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:50:43,983 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:43,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:43,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:50:43,984 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1091422096, now seen corresponding path program 1 times [2021-01-06 19:50:43,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:43,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40682220] [2021-01-06 19:50:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:44,061 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:44,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40682220] [2021-01-06 19:50:44,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:44,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:44,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884467603] [2021-01-06 19:50:44,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:44,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:44,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:44,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:44,065 INFO L87 Difference]: Start difference. First operand 2423 states and 3510 transitions. Second operand 3 states. [2021-01-06 19:50:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:44,328 INFO L93 Difference]: Finished difference Result 4862 states and 7100 transitions. [2021-01-06 19:50:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:44,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:50:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:44,350 INFO L225 Difference]: With dead ends: 4862 [2021-01-06 19:50:44,350 INFO L226 Difference]: Without dead ends: 3515 [2021-01-06 19:50:44,355 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:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2021-01-06 19:50:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 3513. [2021-01-06 19:50:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3513 states. [2021-01-06 19:50:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 5064 transitions. [2021-01-06 19:50:44,666 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 5064 transitions. Word has length 67 [2021-01-06 19:50:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:44,666 INFO L481 AbstractCegarLoop]: Abstraction has 3513 states and 5064 transitions. [2021-01-06 19:50:44,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:50:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5064 transitions. [2021-01-06 19:50:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:50:44,670 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:44,671 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:44,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:50:44,671 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash 639422196, now seen corresponding path program 1 times [2021-01-06 19:50:44,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:44,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971125688] [2021-01-06 19:50:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:50:44,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971125688] [2021-01-06 19:50:44,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:44,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:44,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855333733] [2021-01-06 19:50:44,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:44,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:44,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:44,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:44,812 INFO L87 Difference]: Start difference. First operand 3513 states and 5064 transitions. Second operand 7 states. [2021-01-06 19:50:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:46,083 INFO L93 Difference]: Finished difference Result 21589 states and 31166 transitions. [2021-01-06 19:50:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:46,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2021-01-06 19:50:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:46,158 INFO L225 Difference]: With dead ends: 21589 [2021-01-06 19:50:46,158 INFO L226 Difference]: Without dead ends: 18115 [2021-01-06 19:50:46,168 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:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18115 states. [2021-01-06 19:50:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18115 to 6985. [2021-01-06 19:50:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6985 states. [2021-01-06 19:50:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 10040 transitions. [2021-01-06 19:50:46,880 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 10040 transitions. Word has length 93 [2021-01-06 19:50:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:46,881 INFO L481 AbstractCegarLoop]: Abstraction has 6985 states and 10040 transitions. [2021-01-06 19:50:46,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 10040 transitions. [2021-01-06 19:50:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:50:46,885 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:46,885 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:46,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:50:46,887 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1886929812, now seen corresponding path program 1 times [2021-01-06 19:50:46,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:46,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141748974] [2021-01-06 19:50:46,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:50:47,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141748974] [2021-01-06 19:50:47,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:47,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:47,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451136700] [2021-01-06 19:50:47,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:47,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:47,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:47,086 INFO L87 Difference]: Start difference. First operand 6985 states and 10040 transitions. Second operand 7 states. [2021-01-06 19:50:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:48,506 INFO L93 Difference]: Finished difference Result 25061 states and 36142 transitions. [2021-01-06 19:50:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:48,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2021-01-06 19:50:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:48,562 INFO L225 Difference]: With dead ends: 25061 [2021-01-06 19:50:48,563 INFO L226 Difference]: Without dead ends: 21587 [2021-01-06 19:50:48,575 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:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21587 states. [2021-01-06 19:50:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21587 to 12201. [2021-01-06 19:50:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12201 states. [2021-01-06 19:50:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12201 states to 12201 states and 17464 transitions. [2021-01-06 19:50:49,521 INFO L78 Accepts]: Start accepts. Automaton has 12201 states and 17464 transitions. Word has length 93 [2021-01-06 19:50:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:49,522 INFO L481 AbstractCegarLoop]: Abstraction has 12201 states and 17464 transitions. [2021-01-06 19:50:49,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12201 states and 17464 transitions. [2021-01-06 19:50:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:50:49,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:49,527 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:49,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:50:49,528 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash -938604502, now seen corresponding path program 1 times [2021-01-06 19:50:49,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:49,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737529958] [2021-01-06 19:50:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:50:49,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737529958] [2021-01-06 19:50:49,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:49,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:49,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645473640] [2021-01-06 19:50:49,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:49,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:49,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:49,654 INFO L87 Difference]: Start difference. First operand 12201 states and 17464 transitions. Second operand 7 states. [2021-01-06 19:50:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:51,089 INFO L93 Difference]: Finished difference Result 28533 states and 41118 transitions. [2021-01-06 19:50:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:51,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2021-01-06 19:50:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:51,137 INFO L225 Difference]: With dead ends: 28533 [2021-01-06 19:50:51,138 INFO L226 Difference]: Without dead ends: 25059 [2021-01-06 19:50:51,152 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:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25059 states. [2021-01-06 19:50:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25059 to 15673. [2021-01-06 19:50:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15673 states. [2021-01-06 19:50:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15673 states to 15673 states and 22440 transitions. [2021-01-06 19:50:52,444 INFO L78 Accepts]: Start accepts. Automaton has 15673 states and 22440 transitions. Word has length 93 [2021-01-06 19:50:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:52,445 INFO L481 AbstractCegarLoop]: Abstraction has 15673 states and 22440 transitions. [2021-01-06 19:50:52,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 15673 states and 22440 transitions. [2021-01-06 19:50:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:50:52,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:52,450 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:52,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:50:52,451 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2120903754, now seen corresponding path program 1 times [2021-01-06 19:50:52,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:52,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956471602] [2021-01-06 19:50:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:50:52,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956471602] [2021-01-06 19:50:52,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:52,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:52,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483636071] [2021-01-06 19:50:52,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:52,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:52,579 INFO L87 Difference]: Start difference. First operand 15673 states and 22440 transitions. Second operand 7 states. [2021-01-06 19:50:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:53,975 INFO L93 Difference]: Finished difference Result 32005 states and 46094 transitions. [2021-01-06 19:50:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:53,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2021-01-06 19:50:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:54,034 INFO L225 Difference]: With dead ends: 32005 [2021-01-06 19:50:54,035 INFO L226 Difference]: Without dead ends: 28531 [2021-01-06 19:50:54,049 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:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28531 states. [2021-01-06 19:50:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28531 to 19145. [2021-01-06 19:50:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19145 states. [2021-01-06 19:50:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19145 states to 19145 states and 27416 transitions. [2021-01-06 19:50:55,248 INFO L78 Accepts]: Start accepts. Automaton has 19145 states and 27416 transitions. Word has length 93 [2021-01-06 19:50:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:55,249 INFO L481 AbstractCegarLoop]: Abstraction has 19145 states and 27416 transitions. [2021-01-06 19:50:55,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 19145 states and 27416 transitions. [2021-01-06 19:50:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:50:55,256 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:55,257 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:55,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:50:55,257 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1312606543, now seen corresponding path program 1 times [2021-01-06 19:50:55,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:55,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434701163] [2021-01-06 19:50:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:50:55,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434701163] [2021-01-06 19:50:55,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:55,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:50:55,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434430137] [2021-01-06 19:50:55,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:50:55,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:55,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:50:55,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:50:55,385 INFO L87 Difference]: Start difference. First operand 19145 states and 27416 transitions. Second operand 7 states. [2021-01-06 19:50:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:57,429 INFO L93 Difference]: Finished difference Result 33397 states and 48126 transitions. [2021-01-06 19:50:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:50:57,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2021-01-06 19:50:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:57,471 INFO L225 Difference]: With dead ends: 33397 [2021-01-06 19:50:57,472 INFO L226 Difference]: Without dead ends: 30963 [2021-01-06 19:50:57,482 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:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30963 states. [2021-01-06 19:50:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30963 to 21577. [2021-01-06 19:50:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21577 states. [2021-01-06 19:50:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 30936 transitions. [2021-01-06 19:50:58,974 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 30936 transitions. Word has length 95 [2021-01-06 19:50:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:58,974 INFO L481 AbstractCegarLoop]: Abstraction has 21577 states and 30936 transitions. [2021-01-06 19:50:58,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:50:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 30936 transitions. [2021-01-06 19:50:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:50:58,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:58,982 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:50:58,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:50:58,983 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1044794996, now seen corresponding path program 1 times [2021-01-06 19:50:58,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:58,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879678059] [2021-01-06 19:50:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:50:59,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879678059] [2021-01-06 19:50:59,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:59,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:50:59,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529364420] [2021-01-06 19:50:59,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:50:59,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:59,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:50:59,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:50:59,040 INFO L87 Difference]: Start difference. First operand 21577 states and 30936 transitions. Second operand 3 states. [2021-01-06 19:50:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:50:59,826 INFO L93 Difference]: Finished difference Result 37418 states and 53853 transitions. [2021-01-06 19:50:59,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:50:59,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 19:50:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:50:59,844 INFO L225 Difference]: With dead ends: 37418 [2021-01-06 19:50:59,844 INFO L226 Difference]: Without dead ends: 15880 [2021-01-06 19:50:59,986 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:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15880 states. [2021-01-06 19:51:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15880 to 15878. [2021-01-06 19:51:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15878 states. [2021-01-06 19:51:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15878 states to 15878 states and 22746 transitions. [2021-01-06 19:51:01,114 INFO L78 Accepts]: Start accepts. Automaton has 15878 states and 22746 transitions. Word has length 95 [2021-01-06 19:51:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:01,114 INFO L481 AbstractCegarLoop]: Abstraction has 15878 states and 22746 transitions. [2021-01-06 19:51:01,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:51:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 15878 states and 22746 transitions. [2021-01-06 19:51:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 19:51:01,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:01,120 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:51:01,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:51:01,120 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1472221374, now seen corresponding path program 1 times [2021-01-06 19:51:01,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:01,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357133061] [2021-01-06 19:51:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:01,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357133061] [2021-01-06 19:51:01,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:51:01,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:51:01,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115822460] [2021-01-06 19:51:01,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:51:01,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:01,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:51:01,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:51:01,184 INFO L87 Difference]: Start difference. First operand 15878 states and 22746 transitions. Second operand 3 states. [2021-01-06 19:51:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:01,646 INFO L93 Difference]: Finished difference Result 23786 states and 34084 transitions. [2021-01-06 19:51:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:51:01,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 19:51:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:01,657 INFO L225 Difference]: With dead ends: 23786 [2021-01-06 19:51:01,657 INFO L226 Difference]: Without dead ends: 7976 [2021-01-06 19:51:01,672 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:51:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2021-01-06 19:51:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7974. [2021-01-06 19:51:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2021-01-06 19:51:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 11306 transitions. [2021-01-06 19:51:02,214 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 11306 transitions. Word has length 96 [2021-01-06 19:51:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:02,215 INFO L481 AbstractCegarLoop]: Abstraction has 7974 states and 11306 transitions. [2021-01-06 19:51:02,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:51:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 11306 transitions. [2021-01-06 19:51:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 19:51:02,218 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:02,218 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:51:02,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:51:02,219 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1559340168, now seen corresponding path program 1 times [2021-01-06 19:51:02,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:02,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353653696] [2021-01-06 19:51:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:02,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353653696] [2021-01-06 19:51:02,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:51:02,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:51:02,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385751521] [2021-01-06 19:51:02,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:51:02,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:51:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:51:02,279 INFO L87 Difference]: Start difference. First operand 7974 states and 11306 transitions. Second operand 3 states. [2021-01-06 19:51:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:02,817 INFO L93 Difference]: Finished difference Result 11930 states and 16924 transitions. [2021-01-06 19:51:02,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:51:02,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 19:51:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:02,825 INFO L225 Difference]: With dead ends: 11930 [2021-01-06 19:51:02,825 INFO L226 Difference]: Without dead ends: 4024 [2021-01-06 19:51:02,835 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:51:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2021-01-06 19:51:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4022. [2021-01-06 19:51:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2021-01-06 19:51:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5638 transitions. [2021-01-06 19:51:03,316 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5638 transitions. Word has length 96 [2021-01-06 19:51:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:03,316 INFO L481 AbstractCegarLoop]: Abstraction has 4022 states and 5638 transitions. [2021-01-06 19:51:03,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:51:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5638 transitions. [2021-01-06 19:51:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 19:51:03,319 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:03,319 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:51:03,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:51:03,320 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1616351918, now seen corresponding path program 1 times [2021-01-06 19:51:03,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:03,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71045418] [2021-01-06 19:51:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:03,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71045418] [2021-01-06 19:51:03,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257032012] [2021-01-06 19:51:03,609 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:51:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:03,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 19:51:03,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:51:04,249 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:51:04,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:51:04,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2021-01-06 19:51:04,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038503041] [2021-01-06 19:51:04,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 19:51:04,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:04,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 19:51:04,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:51:04,253 INFO L87 Difference]: Start difference. First operand 4022 states and 5638 transitions. Second operand 12 states. [2021-01-06 19:51:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:09,160 INFO L93 Difference]: Finished difference Result 28565 states and 39385 transitions. [2021-01-06 19:51:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-01-06 19:51:09,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2021-01-06 19:51:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:09,212 INFO L225 Difference]: With dead ends: 28565 [2021-01-06 19:51:09,213 INFO L226 Difference]: Without dead ends: 24611 [2021-01-06 19:51:09,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=525, Invalid=2025, Unknown=0, NotChecked=0, Total=2550 [2021-01-06 19:51:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24611 states. [2021-01-06 19:51:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24611 to 13689. [2021-01-06 19:51:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13689 states. [2021-01-06 19:51:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13689 states to 13689 states and 18621 transitions. [2021-01-06 19:51:10,617 INFO L78 Accepts]: Start accepts. Automaton has 13689 states and 18621 transitions. Word has length 96 [2021-01-06 19:51:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:10,617 INFO L481 AbstractCegarLoop]: Abstraction has 13689 states and 18621 transitions. [2021-01-06 19:51:10,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 19:51:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13689 states and 18621 transitions. [2021-01-06 19:51:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 19:51:10,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:10,622 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, 1] [2021-01-06 19:51:10,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:51:10,839 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1720158323, now seen corresponding path program 1 times [2021-01-06 19:51:10,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:10,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156711268] [2021-01-06 19:51:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:11,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156711268] [2021-01-06 19:51:11,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317133463] [2021-01-06 19:51:11,068 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:51:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:11,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:51:11,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:51:11,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:51:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:11,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:51:11,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-01-06 19:51:11,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101201409] [2021-01-06 19:51:11,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 19:51:11,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 19:51:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:51:11,839 INFO L87 Difference]: Start difference. First operand 13689 states and 18621 transitions. Second operand 17 states. [2021-01-06 19:51:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:25,132 INFO L93 Difference]: Finished difference Result 133696 states and 182309 transitions. [2021-01-06 19:51:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-01-06 19:51:25,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2021-01-06 19:51:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:25,329 INFO L225 Difference]: With dead ends: 133696 [2021-01-06 19:51:25,330 INFO L226 Difference]: Without dead ends: 120725 [2021-01-06 19:51:25,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=660, Invalid=3000, Unknown=0, NotChecked=0, Total=3660 [2021-01-06 19:51:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120725 states. [2021-01-06 19:51:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120725 to 68616. [2021-01-06 19:51:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2021-01-06 19:51:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 91683 transitions. [2021-01-06 19:51:32,583 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 91683 transitions. Word has length 97 [2021-01-06 19:51:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:32,583 INFO L481 AbstractCegarLoop]: Abstraction has 68616 states and 91683 transitions. [2021-01-06 19:51:32,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 19:51:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 91683 transitions. [2021-01-06 19:51:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 19:51:32,587 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:32,587 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:51:32,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:51:32,788 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1760600483, now seen corresponding path program 1 times [2021-01-06 19:51:32,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:32,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205088986] [2021-01-06 19:51:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:32,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205088986] [2021-01-06 19:51:32,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:51:32,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:51:32,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488979728] [2021-01-06 19:51:32,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:51:32,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:32,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:51:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:51:32,890 INFO L87 Difference]: Start difference. First operand 68616 states and 91683 transitions. Second operand 3 states. [2021-01-06 19:51:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:36,679 INFO L93 Difference]: Finished difference Result 99700 states and 133238 transitions. [2021-01-06 19:51:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:51:36,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-06 19:51:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:36,729 INFO L225 Difference]: With dead ends: 99700 [2021-01-06 19:51:36,729 INFO L226 Difference]: Without dead ends: 35921 [2021-01-06 19:51:36,773 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:51:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35921 states. [2021-01-06 19:51:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35921 to 35589. [2021-01-06 19:51:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35589 states. [2021-01-06 19:51:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35589 states to 35589 states and 46617 transitions. [2021-01-06 19:51:40,427 INFO L78 Accepts]: Start accepts. Automaton has 35589 states and 46617 transitions. Word has length 97 [2021-01-06 19:51:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:40,427 INFO L481 AbstractCegarLoop]: Abstraction has 35589 states and 46617 transitions. [2021-01-06 19:51:40,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:51:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 35589 states and 46617 transitions. [2021-01-06 19:51:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 19:51:40,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:40,429 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:51:40,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:51:40,429 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash -58471165, now seen corresponding path program 1 times [2021-01-06 19:51:40,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:40,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288868953] [2021-01-06 19:51:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:51:40,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288868953] [2021-01-06 19:51:40,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:51:40,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:51:40,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975591468] [2021-01-06 19:51:40,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:51:40,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:40,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:51:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:51:40,493 INFO L87 Difference]: Start difference. First operand 35589 states and 46617 transitions. Second operand 3 states. [2021-01-06 19:51:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:42,828 INFO L93 Difference]: Finished difference Result 54733 states and 71876 transitions. [2021-01-06 19:51:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:51:42,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-06 19:51:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:42,851 INFO L225 Difference]: With dead ends: 54733 [2021-01-06 19:51:42,851 INFO L226 Difference]: Without dead ends: 23283 [2021-01-06 19:51:42,865 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:51:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2021-01-06 19:51:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 23281. [2021-01-06 19:51:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23281 states. [2021-01-06 19:51:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23281 states to 23281 states and 29853 transitions. [2021-01-06 19:51:44,878 INFO L78 Accepts]: Start accepts. Automaton has 23281 states and 29853 transitions. Word has length 97 [2021-01-06 19:51:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:44,879 INFO L481 AbstractCegarLoop]: Abstraction has 23281 states and 29853 transitions. [2021-01-06 19:51:44,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:51:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23281 states and 29853 transitions. [2021-01-06 19:51:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 19:51:44,881 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:44,881 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, 1] [2021-01-06 19:51:44,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:51:44,882 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 320648747, now seen corresponding path program 1 times [2021-01-06 19:51:44,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:44,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923274778] [2021-01-06 19:51:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:51:44,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923274778] [2021-01-06 19:51:44,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:51:44,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:51:44,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728830570] [2021-01-06 19:51:44,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:51:44,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:44,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:51:44,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:51:44,967 INFO L87 Difference]: Start difference. First operand 23281 states and 29853 transitions. Second operand 6 states. [2021-01-06 19:51:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:47,029 INFO L93 Difference]: Finished difference Result 43036 states and 55354 transitions. [2021-01-06 19:51:47,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:51:47,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2021-01-06 19:51:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:47,047 INFO L225 Difference]: With dead ends: 43036 [2021-01-06 19:51:47,047 INFO L226 Difference]: Without dead ends: 19907 [2021-01-06 19:51:47,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:51:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19907 states. [2021-01-06 19:51:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19907 to 19907. [2021-01-06 19:51:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19907 states. [2021-01-06 19:51:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19907 states to 19907 states and 25238 transitions. [2021-01-06 19:51:48,775 INFO L78 Accepts]: Start accepts. Automaton has 19907 states and 25238 transitions. Word has length 97 [2021-01-06 19:51:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:48,776 INFO L481 AbstractCegarLoop]: Abstraction has 19907 states and 25238 transitions. [2021-01-06 19:51:48,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:51:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 19907 states and 25238 transitions. [2021-01-06 19:51:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 19:51:48,777 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:48,777 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, 1] [2021-01-06 19:51:48,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:51:48,778 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash -64063125, now seen corresponding path program 1 times [2021-01-06 19:51:48,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:48,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370975776] [2021-01-06 19:51:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:51:48,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370975776] [2021-01-06 19:51:48,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:51:48,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:51:48,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528451862] [2021-01-06 19:51:48,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:51:48,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:51:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:51:48,964 INFO L87 Difference]: Start difference. First operand 19907 states and 25238 transitions. Second operand 6 states. [2021-01-06 19:51:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:50,511 INFO L93 Difference]: Finished difference Result 34697 states and 44160 transitions. [2021-01-06 19:51:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:51:50,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2021-01-06 19:51:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:50,529 INFO L225 Difference]: With dead ends: 34697 [2021-01-06 19:51:50,530 INFO L226 Difference]: Without dead ends: 14960 [2021-01-06 19:51:50,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:51:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14960 states. [2021-01-06 19:51:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14960 to 14960. [2021-01-06 19:51:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14960 states. [2021-01-06 19:51:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14960 states to 14960 states and 18830 transitions. [2021-01-06 19:51:51,946 INFO L78 Accepts]: Start accepts. Automaton has 14960 states and 18830 transitions. Word has length 97 [2021-01-06 19:51:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:51,947 INFO L481 AbstractCegarLoop]: Abstraction has 14960 states and 18830 transitions. [2021-01-06 19:51:51,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:51:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 14960 states and 18830 transitions. [2021-01-06 19:51:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 19:51:51,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:51,948 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, 1] [2021-01-06 19:51:51,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:51:51,949 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 729105995, now seen corresponding path program 1 times [2021-01-06 19:51:51,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:51,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440831258] [2021-01-06 19:51:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:51:52,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440831258] [2021-01-06 19:51:52,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:51:52,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:51:52,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598225142] [2021-01-06 19:51:52,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:51:52,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:52,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:51:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:51:52,023 INFO L87 Difference]: Start difference. First operand 14960 states and 18830 transitions. Second operand 6 states. [2021-01-06 19:51:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:51:53,520 INFO L93 Difference]: Finished difference Result 26500 states and 33550 transitions. [2021-01-06 19:51:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:51:53,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2021-01-06 19:51:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:51:53,536 INFO L225 Difference]: With dead ends: 26500 [2021-01-06 19:51:53,537 INFO L226 Difference]: Without dead ends: 11624 [2021-01-06 19:51:53,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:51:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11624 states. [2021-01-06 19:51:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11624 to 11624. [2021-01-06 19:51:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2021-01-06 19:51:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 14624 transitions. [2021-01-06 19:51:54,699 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 14624 transitions. Word has length 97 [2021-01-06 19:51:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:51:54,699 INFO L481 AbstractCegarLoop]: Abstraction has 11624 states and 14624 transitions. [2021-01-06 19:51:54,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:51:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 14624 transitions. [2021-01-06 19:51:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:51:54,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:51:54,701 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, 1, 1] [2021-01-06 19:51:54,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:51:54,701 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:51:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:51:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash -94994768, now seen corresponding path program 1 times [2021-01-06 19:51:54,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:51:54,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685603975] [2021-01-06 19:51:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:51:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:54,937 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:54,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685603975] [2021-01-06 19:51:54,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455270816] [2021-01-06 19:51:54,938 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:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:51:55,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:51:55,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:51:55,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:51:55,595 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:55,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:51:55,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-01-06 19:51:55,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747336626] [2021-01-06 19:51:55,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 19:51:55,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:51:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 19:51:55,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:51:55,598 INFO L87 Difference]: Start difference. First operand 11624 states and 14624 transitions. Second operand 17 states. [2021-01-06 19:52:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:52:02,583 INFO L93 Difference]: Finished difference Result 59820 states and 74792 transitions. [2021-01-06 19:52:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 19:52:02,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2021-01-06 19:52:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:52:02,631 INFO L225 Difference]: With dead ends: 59820 [2021-01-06 19:52:02,631 INFO L226 Difference]: Without dead ends: 49117 [2021-01-06 19:52:02,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 19:52:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49117 states. [2021-01-06 19:52:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49117 to 29543. [2021-01-06 19:52:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29543 states. [2021-01-06 19:52:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29543 states to 29543 states and 37000 transitions. [2021-01-06 19:52:06,045 INFO L78 Accepts]: Start accepts. Automaton has 29543 states and 37000 transitions. Word has length 98 [2021-01-06 19:52:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:52:06,046 INFO L481 AbstractCegarLoop]: Abstraction has 29543 states and 37000 transitions. [2021-01-06 19:52:06,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 19:52:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29543 states and 37000 transitions. [2021-01-06 19:52:06,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:52:06,048 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:52:06,048 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, 1, 1] [2021-01-06 19:52:06,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 19:52:06,263 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:52:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:52:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2123580878, now seen corresponding path program 1 times [2021-01-06 19:52:06,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:52:06,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778951771] [2021-01-06 19:52:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:52:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:52:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:52:06,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778951771] [2021-01-06 19:52:06,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:52:06,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:52:06,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135197116] [2021-01-06 19:52:06,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:52:06,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:52:06,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:52:06,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:52:06,359 INFO L87 Difference]: Start difference. First operand 29543 states and 37000 transitions. Second operand 7 states. [2021-01-06 19:52:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:52:10,110 INFO L93 Difference]: Finished difference Result 61633 states and 77470 transitions. [2021-01-06 19:52:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:52:10,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2021-01-06 19:52:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:52:10,144 INFO L225 Difference]: With dead ends: 61633 [2021-01-06 19:52:10,144 INFO L226 Difference]: Without dead ends: 32330 [2021-01-06 19:52:10,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:52:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32330 states. [2021-01-06 19:52:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32330 to 32328. [2021-01-06 19:52:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32328 states. [2021-01-06 19:52:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32328 states to 32328 states and 40448 transitions. [2021-01-06 19:52:13,664 INFO L78 Accepts]: Start accepts. Automaton has 32328 states and 40448 transitions. Word has length 98 [2021-01-06 19:52:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:52:13,664 INFO L481 AbstractCegarLoop]: Abstraction has 32328 states and 40448 transitions. [2021-01-06 19:52:13,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:52:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 32328 states and 40448 transitions. [2021-01-06 19:52:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 19:52:13,666 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:52:13,666 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, 1, 1, 1] [2021-01-06 19:52:13,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:52:13,666 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:52:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:52:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash 29054276, now seen corresponding path program 1 times [2021-01-06 19:52:13,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:52:13,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453988866] [2021-01-06 19:52:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:52:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:52:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:52:13,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453988866] [2021-01-06 19:52:13,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554068893] [2021-01-06 19:52:13,886 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:52:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:52:14,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 32 conjunts are in the unsatisfiable core [2021-01-06 19:52:14,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:52:14,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:52:14,727 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2021-01-06 19:52:15,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:52:15,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:52:15,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:52:15,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 19:52:15,742 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 19:52:16,306 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 19:52:16,893 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 19:52:17,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:52:17,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:52:17,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:54:43,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts