/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 15:08:53,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 15:08:53,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 15:08:53,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 15:08:53,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 15:08:53,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 15:08:53,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 15:08:53,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 15:08:53,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 15:08:53,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 15:08:53,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 15:08:53,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 15:08:53,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 15:08:53,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 15:08:53,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 15:08:53,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 15:08:53,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 15:08:53,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 15:08:53,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 15:08:53,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 15:08:53,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 15:08:53,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 15:08:53,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 15:08:53,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 15:08:53,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 15:08:53,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 15:08:53,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 15:08:53,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 15:08:53,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 15:08:53,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 15:08:53,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 15:08:53,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 15:08:53,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 15:08:53,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 15:08:53,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 15:08:53,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 15:08:53,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 15:08:53,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 15:08:53,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 15:08:53,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 15:08:53,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 15:08:53,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 15:08:53,145 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 15:08:53,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 15:08:53,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 15:08:53,146 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 15:08:53,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 15:08:53,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 15:08:53,148 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 15:08:53,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 15:08:53,148 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 15:08:53,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 15:08:53,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 15:08:53,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 15:08:53,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 15:08:53,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 15:08:53,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 15:08:53,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 15:08:53,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 15:08:53,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 15:08:53,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 15:08:53,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 15:08:53,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 15:08:53,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 15:08:53,151 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 15:08:53,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 15:08:53,152 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 15:08:53,152 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/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-06-05 15:08:53,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 15:08:53,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 15:08:53,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 15:08:53,463 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 15:08:53,464 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 15:08:53,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl [2021-06-05 15:08:53,465 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/ticket-4.wvr.bpl' [2021-06-05 15:08:53,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 15:08:53,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 15:08:53,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 15:08:53,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 15:08:53,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 15:08:53,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 15:08:53,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 15:08:53,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 15:08:53,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 15:08:53,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... [2021-06-05 15:08:53,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 15:08:53,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 15:08:53,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 15:08:53,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 15:08:53,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-06-05 15:08:53,603 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 15:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 15:08:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 15:08:53,604 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 15:08:53,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 15:08:53,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 15:08:53,604 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 15:08:53,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 15:08:53,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 15:08:53,605 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 15:08:53,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 15:08:53,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 15:08:53,605 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-05 15:08:53,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-05 15:08:53,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-05 15:08:53,606 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 15:08:53,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 15:08:53,862 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 15:08:53,863 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:08:53 BoogieIcfgContainer [2021-06-05 15:08:53,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 15:08:53,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 15:08:53,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 15:08:53,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 15:08:53,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:08:53" (1/2) ... [2021-06-05 15:08:53,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462446dc and model type ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 03:08:53, skipping insertion in model container [2021-06-05 15:08:53,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:08:53" (2/2) ... [2021-06-05 15:08:53,873 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.bpl [2021-06-05 15:08:53,878 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 15:08:53,878 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 15:08:53,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 15:08:53,879 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 15:08:53,976 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 15:08:53,993 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 15:08:54,009 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 15:08:54,009 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 15:08:54,009 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 15:08:54,009 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 15:08:54,009 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 15:08:54,009 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 15:08:54,009 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 15:08:54,010 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 15:08:54,017 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 38 transitions, 108 flow [2021-06-05 15:08:54,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2078 states, 2076 states have (on average 3.352601156069364) internal successors, (6960), 2077 states have internal predecessors, (6960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 2078 states, 2076 states have (on average 3.352601156069364) internal successors, (6960), 2077 states have internal predecessors, (6960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:54,198 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:54,199 INFO L521 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] [2021-06-05 15:08:54,199 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2025062265, now seen corresponding path program 1 times [2021-06-05 15:08:54,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:54,215 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695081500] [2021-06-05 15:08:54,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:54,410 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:54,410 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695081500] [2021-06-05 15:08:54,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695081500] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:54,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:54,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 15:08:54,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711110041] [2021-06-05 15:08:54,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 15:08:54,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 15:08:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 15:08:54,432 INFO L87 Difference]: Start difference. First operand has 2078 states, 2076 states have (on average 3.352601156069364) internal successors, (6960), 2077 states have internal predecessors, (6960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:54,653 INFO L93 Difference]: Finished difference Result 4667 states and 14949 transitions. [2021-06-05 15:08:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 15:08:54,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:54,704 INFO L225 Difference]: With dead ends: 4667 [2021-06-05 15:08:54,704 INFO L226 Difference]: Without dead ends: 4667 [2021-06-05 15:08:54,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2021-06-05 15:08:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 2700. [2021-06-05 15:08:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 3.277510188958874) internal successors, (8846), 2699 states have internal predecessors, (8846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8846 transitions. [2021-06-05 15:08:54,900 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8846 transitions. Word has length 32 [2021-06-05 15:08:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:54,901 INFO L482 AbstractCegarLoop]: Abstraction has 2700 states and 8846 transitions. [2021-06-05 15:08:54,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8846 transitions. [2021-06-05 15:08:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:54,911 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:54,911 INFO L521 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] [2021-06-05 15:08:54,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 15:08:54,912 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1065960773, now seen corresponding path program 2 times [2021-06-05 15:08:54,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:54,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870689132] [2021-06-05 15:08:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:55,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-06-05 15:08:55,061 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:55,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870689132] [2021-06-05 15:08:55,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870689132] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:55,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:55,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 15:08:55,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808760167] [2021-06-05 15:08:55,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 15:08:55,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 15:08:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 15:08:55,067 INFO L87 Difference]: Start difference. First operand 2700 states and 8846 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:55,138 INFO L93 Difference]: Finished difference Result 3934 states and 12791 transitions. [2021-06-05 15:08:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 15:08:55,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:55,155 INFO L225 Difference]: With dead ends: 3934 [2021-06-05 15:08:55,155 INFO L226 Difference]: Without dead ends: 2423 [2021-06-05 15:08:55,156 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 15:08:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2021-06-05 15:08:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2021-06-05 15:08:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2422 states have (on average 3.1643270024772914) internal successors, (7664), 2422 states have internal predecessors, (7664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 7664 transitions. [2021-06-05 15:08:55,236 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 7664 transitions. Word has length 32 [2021-06-05 15:08:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:55,237 INFO L482 AbstractCegarLoop]: Abstraction has 2423 states and 7664 transitions. [2021-06-05 15:08:55,237 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 7664 transitions. [2021-06-05 15:08:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:55,246 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:55,247 INFO L521 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] [2021-06-05 15:08:55,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 15:08:55,247 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2026635943, now seen corresponding path program 3 times [2021-06-05 15:08:55,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:55,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288378959] [2021-06-05 15:08:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:55,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:55,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288378959] [2021-06-05 15:08:55,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288378959] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:55,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:55,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 15:08:55,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92161744] [2021-06-05 15:08:55,365 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 15:08:55,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:55,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 15:08:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 15:08:55,366 INFO L87 Difference]: Start difference. First operand 2423 states and 7664 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:55,502 INFO L93 Difference]: Finished difference Result 3808 states and 11495 transitions. [2021-06-05 15:08:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 15:08:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:55,523 INFO L225 Difference]: With dead ends: 3808 [2021-06-05 15:08:55,527 INFO L226 Difference]: Without dead ends: 3752 [2021-06-05 15:08:55,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2021-06-05 15:08:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2380. [2021-06-05 15:08:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 3.051282051282051) internal successors, (7259), 2379 states have internal predecessors, (7259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 7259 transitions. [2021-06-05 15:08:55,608 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 7259 transitions. Word has length 32 [2021-06-05 15:08:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:55,608 INFO L482 AbstractCegarLoop]: Abstraction has 2380 states and 7259 transitions. [2021-06-05 15:08:55,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 7259 transitions. [2021-06-05 15:08:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:55,617 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:55,617 INFO L521 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] [2021-06-05 15:08:55,617 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 15:08:55,617 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1029490665, now seen corresponding path program 4 times [2021-06-05 15:08:55,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:55,618 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538220653] [2021-06-05 15:08:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:55,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:55,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538220653] [2021-06-05 15:08:55,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538220653] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:55,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:55,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 15:08:55,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044386479] [2021-06-05 15:08:55,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 15:08:55,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 15:08:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:55,702 INFO L87 Difference]: Start difference. First operand 2380 states and 7259 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:55,871 INFO L93 Difference]: Finished difference Result 4077 states and 12080 transitions. [2021-06-05 15:08:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 15:08:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:55,890 INFO L225 Difference]: With dead ends: 4077 [2021-06-05 15:08:55,890 INFO L226 Difference]: Without dead ends: 4041 [2021-06-05 15:08:55,891 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2021-06-05 15:08:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 2490. [2021-06-05 15:08:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2489 states have (on average 3.0168742466854157) internal successors, (7509), 2489 states have internal predecessors, (7509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 7509 transitions. [2021-06-05 15:08:55,965 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 7509 transitions. Word has length 32 [2021-06-05 15:08:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:55,965 INFO L482 AbstractCegarLoop]: Abstraction has 2490 states and 7509 transitions. [2021-06-05 15:08:55,965 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 7509 transitions. [2021-06-05 15:08:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:55,971 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:55,971 INFO L521 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] [2021-06-05 15:08:55,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 15:08:55,971 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:55,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1807429561, now seen corresponding path program 5 times [2021-06-05 15:08:55,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:55,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394693373] [2021-06-05 15:08:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:56,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:56,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394693373] [2021-06-05 15:08:56,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394693373] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:56,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:56,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 15:08:56,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680703675] [2021-06-05 15:08:56,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 15:08:56,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 15:08:56,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:56,039 INFO L87 Difference]: Start difference. First operand 2490 states and 7509 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:56,239 INFO L93 Difference]: Finished difference Result 4317 states and 12598 transitions. [2021-06-05 15:08:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 15:08:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:56,266 INFO L225 Difference]: With dead ends: 4317 [2021-06-05 15:08:56,266 INFO L226 Difference]: Without dead ends: 4233 [2021-06-05 15:08:56,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 15:08:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2021-06-05 15:08:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2600. [2021-06-05 15:08:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2599 states have (on average 2.981916121585225) internal successors, (7750), 2599 states have internal predecessors, (7750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 7750 transitions. [2021-06-05 15:08:56,356 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 7750 transitions. Word has length 32 [2021-06-05 15:08:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:56,357 INFO L482 AbstractCegarLoop]: Abstraction has 2600 states and 7750 transitions. [2021-06-05 15:08:56,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 7750 transitions. [2021-06-05 15:08:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:56,364 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:56,364 INFO L521 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] [2021-06-05 15:08:56,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 15:08:56,365 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:56,365 INFO L82 PathProgramCache]: Analyzing trace with hash -18545143, now seen corresponding path program 6 times [2021-06-05 15:08:56,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:56,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149414891] [2021-06-05 15:08:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:56,432 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:56,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149414891] [2021-06-05 15:08:56,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149414891] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:56,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:56,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 15:08:56,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326710635] [2021-06-05 15:08:56,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 15:08:56,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 15:08:56,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:56,436 INFO L87 Difference]: Start difference. First operand 2600 states and 7750 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:56,551 INFO L93 Difference]: Finished difference Result 4214 states and 12236 transitions. [2021-06-05 15:08:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 15:08:56,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:56,562 INFO L225 Difference]: With dead ends: 4214 [2021-06-05 15:08:56,562 INFO L226 Difference]: Without dead ends: 4134 [2021-06-05 15:08:56,563 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2021-06-05 15:08:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 2536. [2021-06-05 15:08:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2535 states have (on average 2.967258382642998) internal successors, (7522), 2535 states have internal predecessors, (7522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 7522 transitions. [2021-06-05 15:08:56,638 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 7522 transitions. Word has length 32 [2021-06-05 15:08:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:56,639 INFO L482 AbstractCegarLoop]: Abstraction has 2536 states and 7522 transitions. [2021-06-05 15:08:56,639 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 7522 transitions. [2021-06-05 15:08:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:56,645 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:56,645 INFO L521 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] [2021-06-05 15:08:56,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 15:08:56,646 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 634178151, now seen corresponding path program 7 times [2021-06-05 15:08:56,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:56,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663052901] [2021-06-05 15:08:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:56,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:56,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663052901] [2021-06-05 15:08:56,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663052901] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:56,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:56,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 15:08:56,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896670416] [2021-06-05 15:08:56,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 15:08:56,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 15:08:56,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:56,710 INFO L87 Difference]: Start difference. First operand 2536 states and 7522 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:56,891 INFO L93 Difference]: Finished difference Result 4317 states and 12421 transitions. [2021-06-05 15:08:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 15:08:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:56,902 INFO L225 Difference]: With dead ends: 4317 [2021-06-05 15:08:56,902 INFO L226 Difference]: Without dead ends: 4149 [2021-06-05 15:08:56,904 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 46.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 15:08:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2021-06-05 15:08:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 2547. [2021-06-05 15:08:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 2546 states have (on average 2.9571877454831106) internal successors, (7529), 2546 states have internal predecessors, (7529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 7529 transitions. [2021-06-05 15:08:57,002 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 7529 transitions. Word has length 32 [2021-06-05 15:08:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:57,002 INFO L482 AbstractCegarLoop]: Abstraction has 2547 states and 7529 transitions. [2021-06-05 15:08:57,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 7529 transitions. [2021-06-05 15:08:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:57,008 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:57,008 INFO L521 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] [2021-06-05 15:08:57,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 15:08:57,009 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1676648229, now seen corresponding path program 8 times [2021-06-05 15:08:57,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:57,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848026524] [2021-06-05 15:08:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:57,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:57,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848026524] [2021-06-05 15:08:57,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848026524] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:57,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:57,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 15:08:57,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106132327] [2021-06-05 15:08:57,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 15:08:57,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 15:08:57,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 15:08:57,045 INFO L87 Difference]: Start difference. First operand 2547 states and 7529 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:57,144 INFO L93 Difference]: Finished difference Result 3325 states and 9273 transitions. [2021-06-05 15:08:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 15:08:57,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:57,153 INFO L225 Difference]: With dead ends: 3325 [2021-06-05 15:08:57,153 INFO L226 Difference]: Without dead ends: 3249 [2021-06-05 15:08:57,153 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2021-06-05 15:08:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2124. [2021-06-05 15:08:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2123 states have (on average 2.7960433349034384) internal successors, (5936), 2123 states have internal predecessors, (5936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 5936 transitions. [2021-06-05 15:08:57,210 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 5936 transitions. Word has length 32 [2021-06-05 15:08:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:57,211 INFO L482 AbstractCegarLoop]: Abstraction has 2124 states and 5936 transitions. [2021-06-05 15:08:57,211 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 5936 transitions. [2021-06-05 15:08:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:57,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:57,219 INFO L521 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] [2021-06-05 15:08:57,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 15:08:57,219 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:57,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash -448578393, now seen corresponding path program 9 times [2021-06-05 15:08:57,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:57,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014177048] [2021-06-05 15:08:57,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:57,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:57,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014177048] [2021-06-05 15:08:57,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014177048] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:57,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:57,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 15:08:57,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387998621] [2021-06-05 15:08:57,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 15:08:57,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:57,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 15:08:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:57,287 INFO L87 Difference]: Start difference. First operand 2124 states and 5936 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:57,463 INFO L93 Difference]: Finished difference Result 2967 states and 7732 transitions. [2021-06-05 15:08:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 15:08:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:57,472 INFO L225 Difference]: With dead ends: 2967 [2021-06-05 15:08:57,472 INFO L226 Difference]: Without dead ends: 2753 [2021-06-05 15:08:57,473 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 53.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 15:08:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2021-06-05 15:08:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1853. [2021-06-05 15:08:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 2.6906047516198703) internal successors, (4983), 1852 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4983 transitions. [2021-06-05 15:08:57,519 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4983 transitions. Word has length 32 [2021-06-05 15:08:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:57,520 INFO L482 AbstractCegarLoop]: Abstraction has 1853 states and 4983 transitions. [2021-06-05 15:08:57,520 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4983 transitions. [2021-06-05 15:08:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:57,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:57,524 INFO L521 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] [2021-06-05 15:08:57,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 15:08:57,524 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:57,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1288197813, now seen corresponding path program 10 times [2021-06-05 15:08:57,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:57,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392558095] [2021-06-05 15:08:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:57,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:57,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392558095] [2021-06-05 15:08:57,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392558095] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:57,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:57,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 15:08:57,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301418885] [2021-06-05 15:08:57,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 15:08:57,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 15:08:57,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:57,568 INFO L87 Difference]: Start difference. First operand 1853 states and 4983 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:57,727 INFO L93 Difference]: Finished difference Result 3075 states and 8070 transitions. [2021-06-05 15:08:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 15:08:57,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:57,734 INFO L225 Difference]: With dead ends: 3075 [2021-06-05 15:08:57,735 INFO L226 Difference]: Without dead ends: 3039 [2021-06-05 15:08:57,735 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-05 15:08:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2021-06-05 15:08:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 1770. [2021-06-05 15:08:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 2.6602600339174676) internal successors, (4706), 1769 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 4706 transitions. [2021-06-05 15:08:57,779 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 4706 transitions. Word has length 32 [2021-06-05 15:08:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:57,780 INFO L482 AbstractCegarLoop]: Abstraction has 1770 states and 4706 transitions. [2021-06-05 15:08:57,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 4706 transitions. [2021-06-05 15:08:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:57,785 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:57,785 INFO L521 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] [2021-06-05 15:08:57,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 15:08:57,785 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash 169849257, now seen corresponding path program 11 times [2021-06-05 15:08:57,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:57,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48150533] [2021-06-05 15:08:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:57,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:57,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48150533] [2021-06-05 15:08:57,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48150533] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:57,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:57,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 15:08:57,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76627215] [2021-06-05 15:08:57,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 15:08:57,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 15:08:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:57,830 INFO L87 Difference]: Start difference. First operand 1770 states and 4706 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:58,007 INFO L93 Difference]: Finished difference Result 2951 states and 7706 transitions. [2021-06-05 15:08:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 15:08:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:58,014 INFO L225 Difference]: With dead ends: 2951 [2021-06-05 15:08:58,014 INFO L226 Difference]: Without dead ends: 2867 [2021-06-05 15:08:58,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.1ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 15:08:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2021-06-05 15:08:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1710. [2021-06-05 15:08:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1709 states have (on average 2.641895845523698) internal successors, (4515), 1709 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4515 transitions. [2021-06-05 15:08:58,048 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4515 transitions. Word has length 32 [2021-06-05 15:08:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:58,048 INFO L482 AbstractCegarLoop]: Abstraction has 1710 states and 4515 transitions. [2021-06-05 15:08:58,048 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4515 transitions. [2021-06-05 15:08:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:58,052 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:58,052 INFO L521 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] [2021-06-05 15:08:58,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 15:08:58,052 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1064623707, now seen corresponding path program 12 times [2021-06-05 15:08:58,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:58,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715895688] [2021-06-05 15:08:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:58,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:58,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715895688] [2021-06-05 15:08:58,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715895688] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:58,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:58,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 15:08:58,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817903289] [2021-06-05 15:08:58,105 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 15:08:58,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:58,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 15:08:58,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 15:08:58,106 INFO L87 Difference]: Start difference. First operand 1710 states and 4515 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:58,356 INFO L93 Difference]: Finished difference Result 2931 states and 7585 transitions. [2021-06-05 15:08:58,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 15:08:58,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:58,363 INFO L225 Difference]: With dead ends: 2931 [2021-06-05 15:08:58,363 INFO L226 Difference]: Without dead ends: 2856 [2021-06-05 15:08:58,363 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 85.2ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 15:08:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2021-06-05 15:08:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1711. [2021-06-05 15:08:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1710 states have (on average 2.6187134502923977) internal successors, (4478), 1710 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 4478 transitions. [2021-06-05 15:08:58,397 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 4478 transitions. Word has length 32 [2021-06-05 15:08:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:58,398 INFO L482 AbstractCegarLoop]: Abstraction has 1711 states and 4478 transitions. [2021-06-05 15:08:58,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 4478 transitions. [2021-06-05 15:08:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:58,401 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:58,401 INFO L521 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] [2021-06-05 15:08:58,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 15:08:58,401 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1026776939, now seen corresponding path program 13 times [2021-06-05 15:08:58,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:58,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794309956] [2021-06-05 15:08:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:58,437 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:58,437 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794309956] [2021-06-05 15:08:58,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794309956] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:58,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:58,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 15:08:58,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781803321] [2021-06-05 15:08:58,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 15:08:58,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:58,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 15:08:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:58,438 INFO L87 Difference]: Start difference. First operand 1711 states and 4478 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:58,573 INFO L93 Difference]: Finished difference Result 2936 states and 7562 transitions. [2021-06-05 15:08:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 15:08:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:58,580 INFO L225 Difference]: With dead ends: 2936 [2021-06-05 15:08:58,580 INFO L226 Difference]: Without dead ends: 2888 [2021-06-05 15:08:58,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.1ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-05 15:08:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-06-05 15:08:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1687. [2021-06-05 15:08:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 2.601423487544484) internal successors, (4386), 1686 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4386 transitions. [2021-06-05 15:08:58,617 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4386 transitions. Word has length 32 [2021-06-05 15:08:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:58,617 INFO L482 AbstractCegarLoop]: Abstraction has 1687 states and 4386 transitions. [2021-06-05 15:08:58,617 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4386 transitions. [2021-06-05 15:08:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:58,620 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:58,620 INFO L521 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] [2021-06-05 15:08:58,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 15:08:58,620 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1679500233, now seen corresponding path program 14 times [2021-06-05 15:08:58,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:58,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599725349] [2021-06-05 15:08:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:58,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:58,669 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599725349] [2021-06-05 15:08:58,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599725349] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:58,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:58,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 15:08:58,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345339610] [2021-06-05 15:08:58,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 15:08:58,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:58,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 15:08:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:58,670 INFO L87 Difference]: Start difference. First operand 1687 states and 4386 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:58,842 INFO L93 Difference]: Finished difference Result 2900 states and 7440 transitions. [2021-06-05 15:08:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 15:08:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:58,848 INFO L225 Difference]: With dead ends: 2900 [2021-06-05 15:08:58,848 INFO L226 Difference]: Without dead ends: 2732 [2021-06-05 15:08:58,849 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.1ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 15:08:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2021-06-05 15:08:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1615. [2021-06-05 15:08:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1614 states have (on average 2.587360594795539) internal successors, (4176), 1614 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 4176 transitions. [2021-06-05 15:08:58,880 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 4176 transitions. Word has length 32 [2021-06-05 15:08:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:58,881 INFO L482 AbstractCegarLoop]: Abstraction has 1615 states and 4176 transitions. [2021-06-05 15:08:58,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 4176 transitions. [2021-06-05 15:08:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:58,883 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:58,884 INFO L521 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] [2021-06-05 15:08:58,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 15:08:58,884 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash -79098939, now seen corresponding path program 15 times [2021-06-05 15:08:58,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:58,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159134663] [2021-06-05 15:08:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:58,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:58,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159134663] [2021-06-05 15:08:58,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159134663] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:58,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:58,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 15:08:58,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910613902] [2021-06-05 15:08:58,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 15:08:58,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 15:08:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 15:08:58,935 INFO L87 Difference]: Start difference. First operand 1615 states and 4176 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:59,170 INFO L93 Difference]: Finished difference Result 2846 states and 7269 transitions. [2021-06-05 15:08:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 15:08:59,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:59,175 INFO L225 Difference]: With dead ends: 2846 [2021-06-05 15:08:59,175 INFO L226 Difference]: Without dead ends: 2642 [2021-06-05 15:08:59,176 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 73.7ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 15:08:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2021-06-05 15:08:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 1525. [2021-06-05 15:08:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 2.5990813648293964) internal successors, (3961), 1524 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 3961 transitions. [2021-06-05 15:08:59,206 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 3961 transitions. Word has length 32 [2021-06-05 15:08:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:59,206 INFO L482 AbstractCegarLoop]: Abstraction has 1525 states and 3961 transitions. [2021-06-05 15:08:59,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 3961 transitions. [2021-06-05 15:08:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:59,208 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:59,208 INFO L521 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] [2021-06-05 15:08:59,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 15:08:59,209 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1280334617, now seen corresponding path program 16 times [2021-06-05 15:08:59,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:59,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060483232] [2021-06-05 15:08:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:59,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:59,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060483232] [2021-06-05 15:08:59,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060483232] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:59,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:59,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 15:08:59,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581984765] [2021-06-05 15:08:59,248 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 15:08:59,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 15:08:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:59,249 INFO L87 Difference]: Start difference. First operand 1525 states and 3961 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:59,409 INFO L93 Difference]: Finished difference Result 2648 states and 6780 transitions. [2021-06-05 15:08:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 15:08:59,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:59,413 INFO L225 Difference]: With dead ends: 2648 [2021-06-05 15:08:59,414 INFO L226 Difference]: Without dead ends: 2576 [2021-06-05 15:08:59,414 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 41.4ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 15:08:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2021-06-05 15:08:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1464. [2021-06-05 15:08:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 2.5598086124401913) internal successors, (3745), 1463 states have internal predecessors, (3745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 3745 transitions. [2021-06-05 15:08:59,442 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 3745 transitions. Word has length 32 [2021-06-05 15:08:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:59,442 INFO L482 AbstractCegarLoop]: Abstraction has 1464 states and 3745 transitions. [2021-06-05 15:08:59,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 3745 transitions. [2021-06-05 15:08:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:59,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:59,444 INFO L521 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] [2021-06-05 15:08:59,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 15:08:59,444 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:59,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash -864006587, now seen corresponding path program 17 times [2021-06-05 15:08:59,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:59,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135739978] [2021-06-05 15:08:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:59,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:59,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135739978] [2021-06-05 15:08:59,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135739978] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:59,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:59,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 15:08:59,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759868788] [2021-06-05 15:08:59,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 15:08:59,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 15:08:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 15:08:59,488 INFO L87 Difference]: Start difference. First operand 1464 states and 3745 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:59,702 INFO L93 Difference]: Finished difference Result 2588 states and 6572 transitions. [2021-06-05 15:08:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 15:08:59,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:59,707 INFO L225 Difference]: With dead ends: 2588 [2021-06-05 15:08:59,707 INFO L226 Difference]: Without dead ends: 2505 [2021-06-05 15:08:59,707 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 15:08:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2021-06-05 15:08:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1418. [2021-06-05 15:08:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 2.5772759350741) internal successors, (3652), 1417 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3652 transitions. [2021-06-05 15:08:59,734 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3652 transitions. Word has length 32 [2021-06-05 15:08:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:59,734 INFO L482 AbstractCegarLoop]: Abstraction has 1418 states and 3652 transitions. [2021-06-05 15:08:59,734 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3652 transitions. [2021-06-05 15:08:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:59,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:59,736 INFO L521 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] [2021-06-05 15:08:59,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 15:08:59,736 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682419, now seen corresponding path program 18 times [2021-06-05 15:08:59,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:59,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969137639] [2021-06-05 15:08:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:59,765 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:59,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969137639] [2021-06-05 15:08:59,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969137639] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:59,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:59,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 15:08:59,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692717825] [2021-06-05 15:08:59,765 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 15:08:59,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 15:08:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 15:08:59,766 INFO L87 Difference]: Start difference. First operand 1418 states and 3652 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:08:59,841 INFO L93 Difference]: Finished difference Result 1501 states and 3704 transitions. [2021-06-05 15:08:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 15:08:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:08:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:08:59,844 INFO L225 Difference]: With dead ends: 1501 [2021-06-05 15:08:59,844 INFO L226 Difference]: Without dead ends: 1329 [2021-06-05 15:08:59,844 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 15:08:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-06-05 15:08:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 754. [2021-06-05 15:08:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 2.4674634794156707) internal successors, (1858), 753 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1858 transitions. [2021-06-05 15:08:59,857 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1858 transitions. Word has length 32 [2021-06-05 15:08:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:08:59,857 INFO L482 AbstractCegarLoop]: Abstraction has 754 states and 1858 transitions. [2021-06-05 15:08:59,857 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:08:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1858 transitions. [2021-06-05 15:08:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:08:59,859 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:08:59,859 INFO L521 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] [2021-06-05 15:08:59,859 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 15:08:59,859 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:08:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:08:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1438292239, now seen corresponding path program 19 times [2021-06-05 15:08:59,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:08:59,860 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939609109] [2021-06-05 15:08:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:08:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:08:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:08:59,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:08:59,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939609109] [2021-06-05 15:08:59,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939609109] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:08:59,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:08:59,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 15:08:59,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3358124] [2021-06-05 15:08:59,901 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 15:08:59,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:08:59,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 15:08:59,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 15:08:59,901 INFO L87 Difference]: Start difference. First operand 754 states and 1858 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:09:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:09:00,040 INFO L93 Difference]: Finished difference Result 478 states and 1000 transitions. [2021-06-05 15:09:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 15:09:00,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:09:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:09:00,041 INFO L225 Difference]: With dead ends: 478 [2021-06-05 15:09:00,041 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 15:09:00,041 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 45.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 15:09:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 15:09:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 162. [2021-06-05 15:09:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.1677018633540373) internal successors, (349), 161 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:09:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 349 transitions. [2021-06-05 15:09:00,044 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 349 transitions. Word has length 32 [2021-06-05 15:09:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:09:00,044 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 349 transitions. [2021-06-05 15:09:00,044 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:09:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 349 transitions. [2021-06-05 15:09:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 15:09:00,045 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 15:09:00,045 INFO L521 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] [2021-06-05 15:09:00,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 15:09:00,045 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 15:09:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 15:09:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2002098131, now seen corresponding path program 20 times [2021-06-05 15:09:00,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 15:09:00,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925205402] [2021-06-05 15:09:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 15:09:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 15:09:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 15:09:00,095 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 15:09:00,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925205402] [2021-06-05 15:09:00,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925205402] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 15:09:00,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 15:09:00,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 15:09:00,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050390868] [2021-06-05 15:09:00,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 15:09:00,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 15:09:00,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 15:09:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 15:09:00,097 INFO L87 Difference]: Start difference. First operand 162 states and 349 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:09:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 15:09:00,211 INFO L93 Difference]: Finished difference Result 105 states and 189 transitions. [2021-06-05 15:09:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 15:09:00,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 15:09:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 15:09:00,212 INFO L225 Difference]: With dead ends: 105 [2021-06-05 15:09:00,212 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 15:09:00,212 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 15:09:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 15:09:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 15:09:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:09:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 15:09:00,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-06-05 15:09:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 15:09:00,213 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 15:09:00,213 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 15:09:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 15:09:00,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 15:09:00,213 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 15:09:00,214 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 15:09:00,216 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 03:09:00 BasicIcfg [2021-06-05 15:09:00,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 15:09:00,217 INFO L168 Benchmark]: Toolchain (without parser) took 6708.79 ms. Allocated memory was 360.7 MB in the beginning and 545.3 MB in the end (delta: 184.5 MB). Free memory was 340.0 MB in the beginning and 363.0 MB in the end (delta: -23.0 MB). Peak memory consumption was 163.1 MB. Max. memory is 16.0 GB. [2021-06-05 15:09:00,217 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 360.7 MB. Free memory was 341.1 MB in the beginning and 341.0 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 15:09:00,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.21 ms. Allocated memory is still 360.7 MB. Free memory was 339.9 MB in the beginning and 338.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 15:09:00,218 INFO L168 Benchmark]: Boogie Preprocessor took 10.67 ms. Allocated memory is still 360.7 MB. Free memory was 338.4 MB in the beginning and 337.5 MB in the end (delta: 970.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 15:09:00,218 INFO L168 Benchmark]: RCFGBuilder took 317.58 ms. Allocated memory is still 360.7 MB. Free memory was 337.4 MB in the beginning and 323.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-06-05 15:09:00,218 INFO L168 Benchmark]: TraceAbstraction took 6351.92 ms. Allocated memory was 360.7 MB in the beginning and 545.3 MB in the end (delta: 184.5 MB). Free memory was 323.3 MB in the beginning and 363.0 MB in the end (delta: -39.7 MB). Peak memory consumption was 146.3 MB. Max. memory is 16.0 GB. [2021-06-05 15:09:00,219 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 360.7 MB. Free memory was 341.1 MB in the beginning and 341.0 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 20.21 ms. Allocated memory is still 360.7 MB. Free memory was 339.9 MB in the beginning and 338.4 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 10.67 ms. Allocated memory is still 360.7 MB. Free memory was 338.4 MB in the beginning and 337.5 MB in the end (delta: 970.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 317.58 ms. Allocated memory is still 360.7 MB. Free memory was 337.4 MB in the beginning and 323.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6351.92 ms. Allocated memory was 360.7 MB in the beginning and 545.3 MB in the end (delta: 184.5 MB). Free memory was 323.3 MB in the beginning and 363.0 MB in the end (delta: -39.7 MB). Peak memory consumption was 146.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 68 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6206.7ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 115.6ms, AutomataDifference: 3470.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 154.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1031 SDtfs, 1435 SDslu, 3418 SDs, 0 SdLazy, 3417 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1850.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 853.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2700occurred in iteration=1, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1061.0ms AutomataMinimizationTime, 20 MinimizatonAttempts, 21600 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.6ms SsaConstructionTime, 163.3ms SatisfiabilityAnalysisTime, 996.2ms InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...