/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.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 05:15:40,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 05:15:40,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 05:15:40,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 05:15:40,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 05:15:40,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 05:15:40,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 05:15:40,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 05:15:40,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 05:15:40,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 05:15:40,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 05:15:40,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 05:15:40,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 05:15:40,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 05:15:40,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 05:15:40,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 05:15:40,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 05:15:40,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 05:15:40,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 05:15:40,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 05:15:40,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 05:15:40,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 05:15:40,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 05:15:40,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 05:15:40,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 05:15:40,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 05:15:40,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 05:15:40,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 05:15:40,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 05:15:40,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 05:15:40,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 05:15:40,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 05:15:40,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 05:15:40,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 05:15:40,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 05:15:40,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 05:15:40,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 05:15:40,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 05:15:40,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 05:15:40,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 05:15:40,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 05:15:40,466 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.epf [2021-06-05 05:15:40,500 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 05:15:40,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 05:15:40,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 05:15:40,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 05:15:40,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 05:15:40,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 05:15:40,503 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 05:15:40,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 05:15:40,504 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 05:15:40,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 05:15:40,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 05:15:40,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 05:15:40,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 05:15:40,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 05:15:40,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 05:15:40,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 05:15:40,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 05:15:40,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 05:15:40,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 05:15:40,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 05:15:40,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 05:15:40,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 05:15:40,507 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 05:15:40,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 05:15:40,507 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 05:15:40,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 05:15:40,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 05:15:40,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 05:15:40,815 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 05:15:40,816 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 05:15:40,817 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 05:15:40,817 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 05:15:40,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 05:15:40,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 05:15:40,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 05:15:40,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 05:15:40,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 05:15:40,901 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,907 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 05:15:40,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 05:15:40,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 05:15:40,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 05:15:40,923 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,923 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,924 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,924 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,927 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,927 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,928 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 05:15:40" (1/1) ... [2021-06-05 05:15:40,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 05:15:40,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 05:15:40,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 05:15:40,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 05:15:40,931 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 05:15:40" (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 05:15:40,993 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 05:15:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 05:15:40,993 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 05:15:40,993 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 05:15:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 05:15:40,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 05:15:40,994 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 05:15:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 05:15:40,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 05:15:40,994 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 05:15:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 05:15:40,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 05:15:40,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-05 05:15:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-05 05:15:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-05 05:15:40,997 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 05:15:41,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 05:15:41,193 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 05:15:41,194 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 05:15:41 BoogieIcfgContainer [2021-06-05 05:15:41,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 05:15:41,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 05:15:41,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 05:15:41,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 05:15:41,198 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 05:15:40" (1/2) ... [2021-06-05 05:15:41,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373aaa6c and model type ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 05:15:41, skipping insertion in model container [2021-06-05 05:15:41,199 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 05:15:41" (2/2) ... [2021-06-05 05:15:41,201 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.bpl [2021-06-05 05:15:41,205 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 05:15:41,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 05:15:41,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 05:15:41,206 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 05:15:41,246 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 05:15:41,271 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 05:15:41,286 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 05:15:41,286 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 05:15:41,287 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 05:15:41,287 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 05:15:41,287 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 05:15:41,287 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 05:15:41,287 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 05:15:41,287 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 05:15:41,296 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 38 transitions, 108 flow [2021-06-05 05:15:41,522 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 05:15:41,530 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 05:15:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:41,559 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:41,560 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 05:15:41,560 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2025062265, now seen corresponding path program 1 times [2021-06-05 05:15:41,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:41,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180046360] [2021-06-05 05:15:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:41,750 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 05:15:41,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:41,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180046360] [2021-06-05 05:15:41,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180046360] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:41,752 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:41,752 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 05:15:41,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203655869] [2021-06-05 05:15:41,756 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:15:41,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:41,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:15:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:15:41,774 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 05:15:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:41,985 INFO L93 Difference]: Finished difference Result 4667 states and 14949 transitions. [2021-06-05 05:15:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 05:15:41,986 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 05:15:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:42,032 INFO L225 Difference]: With dead ends: 4667 [2021-06-05 05:15:42,032 INFO L226 Difference]: Without dead ends: 4667 [2021-06-05 05:15:42,034 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:15:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2021-06-05 05:15:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 2700. [2021-06-05 05:15:42,240 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 05:15:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8846 transitions. [2021-06-05 05:15:42,256 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8846 transitions. Word has length 32 [2021-06-05 05:15:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:42,257 INFO L482 AbstractCegarLoop]: Abstraction has 2700 states and 8846 transitions. [2021-06-05 05:15:42,257 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 05:15:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8846 transitions. [2021-06-05 05:15:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:42,268 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:42,269 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 05:15:42,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 05:15:42,270 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1065960773, now seen corresponding path program 2 times [2021-06-05 05:15:42,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:42,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140407838] [2021-06-05 05:15:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:42,448 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 05:15:42,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:42,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140407838] [2021-06-05 05:15:42,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140407838] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:42,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:42,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 05:15:42,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699513284] [2021-06-05 05:15:42,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:15:42,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:15:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:15:42,452 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 05:15:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:42,515 INFO L93 Difference]: Finished difference Result 3934 states and 12791 transitions. [2021-06-05 05:15:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 05:15:42,517 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 05:15:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:42,531 INFO L225 Difference]: With dead ends: 3934 [2021-06-05 05:15:42,532 INFO L226 Difference]: Without dead ends: 2423 [2021-06-05 05:15:42,532 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:15:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2021-06-05 05:15:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2021-06-05 05:15:42,613 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 05:15:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 7664 transitions. [2021-06-05 05:15:42,625 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 7664 transitions. Word has length 32 [2021-06-05 05:15:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:42,625 INFO L482 AbstractCegarLoop]: Abstraction has 2423 states and 7664 transitions. [2021-06-05 05:15:42,626 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 05:15:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 7664 transitions. [2021-06-05 05:15:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:42,636 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:42,637 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 05:15:42,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 05:15:42,638 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:42,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2026635943, now seen corresponding path program 3 times [2021-06-05 05:15:42,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:42,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251823025] [2021-06-05 05:15:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:42,736 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 05:15:42,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:42,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251823025] [2021-06-05 05:15:42,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251823025] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:42,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:42,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 05:15:42,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393216443] [2021-06-05 05:15:42,738 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:15:42,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:15:42,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:15:42,742 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 05:15:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:42,900 INFO L93 Difference]: Finished difference Result 3808 states and 11495 transitions. [2021-06-05 05:15:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 05:15:42,903 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 05:15:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:42,923 INFO L225 Difference]: With dead ends: 3808 [2021-06-05 05:15:42,923 INFO L226 Difference]: Without dead ends: 3752 [2021-06-05 05:15:42,928 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:15:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2021-06-05 05:15:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2380. [2021-06-05 05:15:43,029 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 05:15:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 7259 transitions. [2021-06-05 05:15:43,039 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 7259 transitions. Word has length 32 [2021-06-05 05:15:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:43,039 INFO L482 AbstractCegarLoop]: Abstraction has 2380 states and 7259 transitions. [2021-06-05 05:15:43,040 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 05:15:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 7259 transitions. [2021-06-05 05:15:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:43,049 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:43,049 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 05:15:43,049 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 05:15:43,049 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1029490665, now seen corresponding path program 4 times [2021-06-05 05:15:43,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:43,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258421764] [2021-06-05 05:15:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:43,128 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 05:15:43,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:43,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258421764] [2021-06-05 05:15:43,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258421764] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:43,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:43,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 05:15:43,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027717373] [2021-06-05 05:15:43,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:15:43,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:15:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:15:43,133 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 05:15:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:43,291 INFO L93 Difference]: Finished difference Result 4077 states and 12080 transitions. [2021-06-05 05:15:43,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 05:15:43,292 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 05:15:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:43,361 INFO L225 Difference]: With dead ends: 4077 [2021-06-05 05:15:43,361 INFO L226 Difference]: Without dead ends: 4041 [2021-06-05 05:15:43,361 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 25.3ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2021-06-05 05:15:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 2490. [2021-06-05 05:15:43,457 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 05:15:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 7509 transitions. [2021-06-05 05:15:43,468 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 7509 transitions. Word has length 32 [2021-06-05 05:15:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:43,468 INFO L482 AbstractCegarLoop]: Abstraction has 2490 states and 7509 transitions. [2021-06-05 05:15:43,469 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 05:15:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 7509 transitions. [2021-06-05 05:15:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:43,476 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:43,476 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 05:15:43,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 05:15:43,476 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1807429561, now seen corresponding path program 5 times [2021-06-05 05:15:43,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:43,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19645881] [2021-06-05 05:15:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 05:15:43,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:43,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19645881] [2021-06-05 05:15:43,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19645881] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:43,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:43,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 05:15:43,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871355772] [2021-06-05 05:15:43,526 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:15:43,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:15:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:43,527 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 05:15:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:43,718 INFO L93 Difference]: Finished difference Result 4317 states and 12598 transitions. [2021-06-05 05:15:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:15:43,719 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 05:15:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:43,732 INFO L225 Difference]: With dead ends: 4317 [2021-06-05 05:15:43,732 INFO L226 Difference]: Without dead ends: 4233 [2021-06-05 05:15:43,732 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:15:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2021-06-05 05:15:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2600. [2021-06-05 05:15:43,806 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 05:15:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 7750 transitions. [2021-06-05 05:15:43,819 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 7750 transitions. Word has length 32 [2021-06-05 05:15:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:43,820 INFO L482 AbstractCegarLoop]: Abstraction has 2600 states and 7750 transitions. [2021-06-05 05:15:43,826 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 05:15:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 7750 transitions. [2021-06-05 05:15:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:43,833 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:43,833 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 05:15:43,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 05:15:43,834 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:43,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash -18545143, now seen corresponding path program 6 times [2021-06-05 05:15:43,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:43,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895393803] [2021-06-05 05:15:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:43,890 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 05:15:43,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:43,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895393803] [2021-06-05 05:15:43,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895393803] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:43,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:43,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 05:15:43,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541974602] [2021-06-05 05:15:43,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:15:43,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:15:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:15:43,892 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 05:15:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:44,013 INFO L93 Difference]: Finished difference Result 4214 states and 12236 transitions. [2021-06-05 05:15:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 05:15:44,013 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 05:15:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:44,025 INFO L225 Difference]: With dead ends: 4214 [2021-06-05 05:15:44,025 INFO L226 Difference]: Without dead ends: 4134 [2021-06-05 05:15:44,026 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2021-06-05 05:15:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 2536. [2021-06-05 05:15:44,098 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 05:15:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 7522 transitions. [2021-06-05 05:15:44,108 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 7522 transitions. Word has length 32 [2021-06-05 05:15:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:44,108 INFO L482 AbstractCegarLoop]: Abstraction has 2536 states and 7522 transitions. [2021-06-05 05:15:44,108 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 05:15:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 7522 transitions. [2021-06-05 05:15:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:44,115 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:44,115 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 05:15:44,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 05:15:44,115 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash 634178151, now seen corresponding path program 7 times [2021-06-05 05:15:44,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:44,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026792414] [2021-06-05 05:15:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:44,190 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 05:15:44,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:44,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026792414] [2021-06-05 05:15:44,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026792414] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:44,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:44,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 05:15:44,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618719839] [2021-06-05 05:15:44,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:15:44,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:44,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:15:44,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:44,192 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 05:15:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:44,387 INFO L93 Difference]: Finished difference Result 4317 states and 12421 transitions. [2021-06-05 05:15:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:15:44,387 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 05:15:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:44,400 INFO L225 Difference]: With dead ends: 4317 [2021-06-05 05:15:44,400 INFO L226 Difference]: Without dead ends: 4149 [2021-06-05 05:15:44,400 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:15:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2021-06-05 05:15:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 2547. [2021-06-05 05:15:44,484 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 05:15:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 7529 transitions. [2021-06-05 05:15:44,495 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 7529 transitions. Word has length 32 [2021-06-05 05:15:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:44,495 INFO L482 AbstractCegarLoop]: Abstraction has 2547 states and 7529 transitions. [2021-06-05 05:15:44,495 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 05:15:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 7529 transitions. [2021-06-05 05:15:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:44,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:44,503 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 05:15:44,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 05:15:44,503 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:44,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1676648229, now seen corresponding path program 8 times [2021-06-05 05:15:44,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:44,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012343370] [2021-06-05 05:15:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:44,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 05:15:44,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:44,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012343370] [2021-06-05 05:15:44,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012343370] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:44,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:44,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 05:15:44,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115826199] [2021-06-05 05:15:44,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:15:44,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:44,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:15:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:15:44,568 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 05:15:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:44,671 INFO L93 Difference]: Finished difference Result 3325 states and 9273 transitions. [2021-06-05 05:15:44,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 05:15:44,671 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 05:15:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:44,680 INFO L225 Difference]: With dead ends: 3325 [2021-06-05 05:15:44,680 INFO L226 Difference]: Without dead ends: 3249 [2021-06-05 05:15:44,680 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:15:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2021-06-05 05:15:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2124. [2021-06-05 05:15:44,740 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 05:15:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 5936 transitions. [2021-06-05 05:15:44,749 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 5936 transitions. Word has length 32 [2021-06-05 05:15:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:44,749 INFO L482 AbstractCegarLoop]: Abstraction has 2124 states and 5936 transitions. [2021-06-05 05:15:44,750 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 05:15:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 5936 transitions. [2021-06-05 05:15:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:44,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:44,755 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 05:15:44,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 05:15:44,755 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash -448578393, now seen corresponding path program 9 times [2021-06-05 05:15:44,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:44,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897415519] [2021-06-05 05:15:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:44,805 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 05:15:44,805 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:44,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897415519] [2021-06-05 05:15:44,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897415519] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:44,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:44,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 05:15:44,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665407730] [2021-06-05 05:15:44,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:15:44,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:44,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:15:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:44,807 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 05:15:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:44,953 INFO L93 Difference]: Finished difference Result 2967 states and 7732 transitions. [2021-06-05 05:15:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:15:44,953 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 05:15:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:44,960 INFO L225 Difference]: With dead ends: 2967 [2021-06-05 05:15:44,960 INFO L226 Difference]: Without dead ends: 2753 [2021-06-05 05:15:44,961 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 45.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:15:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2021-06-05 05:15:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1853. [2021-06-05 05:15:45,008 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 05:15:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4983 transitions. [2021-06-05 05:15:45,014 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4983 transitions. Word has length 32 [2021-06-05 05:15:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:45,014 INFO L482 AbstractCegarLoop]: Abstraction has 1853 states and 4983 transitions. [2021-06-05 05:15:45,014 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 05:15:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4983 transitions. [2021-06-05 05:15:45,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:45,018 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:45,018 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 05:15:45,019 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 05:15:45,019 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1288197813, now seen corresponding path program 10 times [2021-06-05 05:15:45,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:45,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239482021] [2021-06-05 05:15:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:45,078 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 05:15:45,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:45,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239482021] [2021-06-05 05:15:45,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239482021] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:45,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:45,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 05:15:45,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587692528] [2021-06-05 05:15:45,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:15:45,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:45,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:15:45,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:15:45,080 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 05:15:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:45,215 INFO L93 Difference]: Finished difference Result 3075 states and 8070 transitions. [2021-06-05 05:15:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 05:15:45,216 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 05:15:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:45,224 INFO L225 Difference]: With dead ends: 3075 [2021-06-05 05:15:45,224 INFO L226 Difference]: Without dead ends: 3039 [2021-06-05 05:15:45,224 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.2ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:15:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2021-06-05 05:15:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 1770. [2021-06-05 05:15:45,270 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 05:15:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 4706 transitions. [2021-06-05 05:15:45,280 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 4706 transitions. Word has length 32 [2021-06-05 05:15:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:45,281 INFO L482 AbstractCegarLoop]: Abstraction has 1770 states and 4706 transitions. [2021-06-05 05:15:45,281 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 05:15:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 4706 transitions. [2021-06-05 05:15:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:45,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:45,285 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 05:15:45,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 05:15:45,285 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 169849257, now seen corresponding path program 11 times [2021-06-05 05:15:45,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:45,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904431698] [2021-06-05 05:15:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:45,345 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 05:15:45,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:45,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904431698] [2021-06-05 05:15:45,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904431698] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:45,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:45,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 05:15:45,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35096761] [2021-06-05 05:15:45,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:15:45,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:45,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:15:45,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:45,348 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 05:15:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:45,521 INFO L93 Difference]: Finished difference Result 2951 states and 7706 transitions. [2021-06-05 05:15:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:15:45,522 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 05:15:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:45,528 INFO L225 Difference]: With dead ends: 2951 [2021-06-05 05:15:45,528 INFO L226 Difference]: Without dead ends: 2867 [2021-06-05 05:15:45,529 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.6ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:15:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2021-06-05 05:15:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1710. [2021-06-05 05:15:45,566 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 05:15:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4515 transitions. [2021-06-05 05:15:45,570 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4515 transitions. Word has length 32 [2021-06-05 05:15:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:45,570 INFO L482 AbstractCegarLoop]: Abstraction has 1710 states and 4515 transitions. [2021-06-05 05:15:45,570 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 05:15:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4515 transitions. [2021-06-05 05:15:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:45,574 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:45,574 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 05:15:45,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 05:15:45,574 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:45,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1064623707, now seen corresponding path program 12 times [2021-06-05 05:15:45,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:45,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234029709] [2021-06-05 05:15:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:45,637 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 05:15:45,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:45,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234029709] [2021-06-05 05:15:45,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234029709] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:45,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:45,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 05:15:45,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468893135] [2021-06-05 05:15:45,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 05:15:45,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:45,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 05:15:45,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:15:45,639 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 05:15:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:45,885 INFO L93 Difference]: Finished difference Result 2931 states and 7585 transitions. [2021-06-05 05:15:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 05:15:45,885 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 05:15:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:45,892 INFO L225 Difference]: With dead ends: 2931 [2021-06-05 05:15:45,892 INFO L226 Difference]: Without dead ends: 2856 [2021-06-05 05:15:45,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 76.9ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 05:15:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2021-06-05 05:15:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1711. [2021-06-05 05:15:45,929 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 05:15:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 4478 transitions. [2021-06-05 05:15:45,933 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 4478 transitions. Word has length 32 [2021-06-05 05:15:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:45,933 INFO L482 AbstractCegarLoop]: Abstraction has 1711 states and 4478 transitions. [2021-06-05 05:15:45,933 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 05:15:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 4478 transitions. [2021-06-05 05:15:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:45,937 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:45,937 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 05:15:45,937 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 05:15:45,937 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1026776939, now seen corresponding path program 13 times [2021-06-05 05:15:45,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:45,938 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906027159] [2021-06-05 05:15:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:45,979 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 05:15:45,979 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:45,979 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906027159] [2021-06-05 05:15:45,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906027159] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:45,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:45,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 05:15:45,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676391811] [2021-06-05 05:15:45,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 05:15:45,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 05:15:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 05:15:45,981 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 05:15:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:46,131 INFO L93 Difference]: Finished difference Result 2936 states and 7562 transitions. [2021-06-05 05:15:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 05:15:46,132 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 05:15:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:46,139 INFO L225 Difference]: With dead ends: 2936 [2021-06-05 05:15:46,139 INFO L226 Difference]: Without dead ends: 2888 [2021-06-05 05:15:46,139 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:15:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-06-05 05:15:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1687. [2021-06-05 05:15:46,179 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 05:15:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4386 transitions. [2021-06-05 05:15:46,184 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4386 transitions. Word has length 32 [2021-06-05 05:15:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:46,184 INFO L482 AbstractCegarLoop]: Abstraction has 1687 states and 4386 transitions. [2021-06-05 05:15:46,184 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 05:15:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4386 transitions. [2021-06-05 05:15:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:46,188 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:46,188 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 05:15:46,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 05:15:46,188 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1679500233, now seen corresponding path program 14 times [2021-06-05 05:15:46,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:46,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275265692] [2021-06-05 05:15:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:46,233 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 05:15:46,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:46,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275265692] [2021-06-05 05:15:46,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275265692] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:46,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:46,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 05:15:46,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211153983] [2021-06-05 05:15:46,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:15:46,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:46,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:15:46,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:46,235 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 05:15:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:46,436 INFO L93 Difference]: Finished difference Result 2900 states and 7440 transitions. [2021-06-05 05:15:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:15:46,437 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 05:15:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:46,443 INFO L225 Difference]: With dead ends: 2900 [2021-06-05 05:15:46,443 INFO L226 Difference]: Without dead ends: 2732 [2021-06-05 05:15:46,444 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.5ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:15:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2021-06-05 05:15:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1615. [2021-06-05 05:15:46,478 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 05:15:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 4176 transitions. [2021-06-05 05:15:46,482 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 4176 transitions. Word has length 32 [2021-06-05 05:15:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:46,482 INFO L482 AbstractCegarLoop]: Abstraction has 1615 states and 4176 transitions. [2021-06-05 05:15:46,483 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 05:15:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 4176 transitions. [2021-06-05 05:15:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:46,486 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:46,486 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 05:15:46,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 05:15:46,487 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash -79098939, now seen corresponding path program 15 times [2021-06-05 05:15:46,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:46,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103641323] [2021-06-05 05:15:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:46,532 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 05:15:46,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:46,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103641323] [2021-06-05 05:15:46,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103641323] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:46,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:46,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 05:15:46,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731255397] [2021-06-05 05:15:46,533 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 05:15:46,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:46,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 05:15:46,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:15:46,534 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 05:15:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:46,788 INFO L93 Difference]: Finished difference Result 2846 states and 7269 transitions. [2021-06-05 05:15:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 05:15:46,788 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 05:15:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:46,796 INFO L225 Difference]: With dead ends: 2846 [2021-06-05 05:15:46,796 INFO L226 Difference]: Without dead ends: 2642 [2021-06-05 05:15:46,796 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 05:15:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2021-06-05 05:15:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 1525. [2021-06-05 05:15:46,828 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 05:15:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 3961 transitions. [2021-06-05 05:15:46,832 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 3961 transitions. Word has length 32 [2021-06-05 05:15:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:46,832 INFO L482 AbstractCegarLoop]: Abstraction has 1525 states and 3961 transitions. [2021-06-05 05:15:46,832 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 05:15:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 3961 transitions. [2021-06-05 05:15:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:46,837 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:46,837 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 05:15:46,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 05:15:46,837 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1280334617, now seen corresponding path program 16 times [2021-06-05 05:15:46,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:46,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446116665] [2021-06-05 05:15:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:46,876 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 05:15:46,876 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:46,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446116665] [2021-06-05 05:15:46,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446116665] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:46,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:46,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 05:15:46,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637315421] [2021-06-05 05:15:46,877 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:15:46,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:15:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:46,878 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 05:15:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:47,042 INFO L93 Difference]: Finished difference Result 2648 states and 6780 transitions. [2021-06-05 05:15:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:15:47,042 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 05:15:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:47,048 INFO L225 Difference]: With dead ends: 2648 [2021-06-05 05:15:47,049 INFO L226 Difference]: Without dead ends: 2576 [2021-06-05 05:15:47,049 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 43.4ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:15:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2021-06-05 05:15:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1464. [2021-06-05 05:15:47,078 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 05:15:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 3745 transitions. [2021-06-05 05:15:47,081 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 3745 transitions. Word has length 32 [2021-06-05 05:15:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:47,082 INFO L482 AbstractCegarLoop]: Abstraction has 1464 states and 3745 transitions. [2021-06-05 05:15:47,082 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 05:15:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 3745 transitions. [2021-06-05 05:15:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:47,086 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:47,086 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 05:15:47,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 05:15:47,086 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash -864006587, now seen corresponding path program 17 times [2021-06-05 05:15:47,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:47,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964878150] [2021-06-05 05:15:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:47,142 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 05:15:47,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:47,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964878150] [2021-06-05 05:15:47,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964878150] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:47,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:47,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 05:15:47,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672417268] [2021-06-05 05:15:47,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 05:15:47,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:47,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 05:15:47,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:15:47,144 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 05:15:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:47,372 INFO L93 Difference]: Finished difference Result 2588 states and 6572 transitions. [2021-06-05 05:15:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 05:15:47,373 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 05:15:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:47,379 INFO L225 Difference]: With dead ends: 2588 [2021-06-05 05:15:47,379 INFO L226 Difference]: Without dead ends: 2505 [2021-06-05 05:15:47,379 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 82.0ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-06-05 05:15:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2021-06-05 05:15:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1418. [2021-06-05 05:15:47,408 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 05:15:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3652 transitions. [2021-06-05 05:15:47,411 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3652 transitions. Word has length 32 [2021-06-05 05:15:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:47,411 INFO L482 AbstractCegarLoop]: Abstraction has 1418 states and 3652 transitions. [2021-06-05 05:15:47,411 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 05:15:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3652 transitions. [2021-06-05 05:15:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:47,414 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:47,414 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 05:15:47,414 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 05:15:47,414 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682419, now seen corresponding path program 18 times [2021-06-05 05:15:47,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:47,415 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174830120] [2021-06-05 05:15:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:47,441 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 05:15:47,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:47,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174830120] [2021-06-05 05:15:47,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174830120] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:47,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:47,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 05:15:47,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743329020] [2021-06-05 05:15:47,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 05:15:47,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 05:15:47,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 05:15:47,443 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 05:15:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:47,520 INFO L93 Difference]: Finished difference Result 1501 states and 3704 transitions. [2021-06-05 05:15:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 05:15:47,521 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 05:15:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:47,524 INFO L225 Difference]: With dead ends: 1501 [2021-06-05 05:15:47,524 INFO L226 Difference]: Without dead ends: 1329 [2021-06-05 05:15:47,524 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 05:15:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-06-05 05:15:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 754. [2021-06-05 05:15:47,538 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 05:15:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1858 transitions. [2021-06-05 05:15:47,540 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1858 transitions. Word has length 32 [2021-06-05 05:15:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:47,540 INFO L482 AbstractCegarLoop]: Abstraction has 754 states and 1858 transitions. [2021-06-05 05:15:47,540 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 05:15:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1858 transitions. [2021-06-05 05:15:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:47,542 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:47,542 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 05:15:47,542 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 05:15:47,542 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1438292239, now seen corresponding path program 19 times [2021-06-05 05:15:47,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:47,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352260504] [2021-06-05 05:15:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:47,580 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 05:15:47,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:47,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352260504] [2021-06-05 05:15:47,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352260504] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:47,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:47,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 05:15:47,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807003553] [2021-06-05 05:15:47,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 05:15:47,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 05:15:47,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 05:15:47,581 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 05:15:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:47,721 INFO L93 Difference]: Finished difference Result 478 states and 1000 transitions. [2021-06-05 05:15:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 05:15:47,721 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 05:15:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:47,722 INFO L225 Difference]: With dead ends: 478 [2021-06-05 05:15:47,722 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 05:15:47,722 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 43.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 05:15:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 05:15:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 162. [2021-06-05 05:15:47,725 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 05:15:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 349 transitions. [2021-06-05 05:15:47,725 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 349 transitions. Word has length 32 [2021-06-05 05:15:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:47,726 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 349 transitions. [2021-06-05 05:15:47,726 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 05:15:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 349 transitions. [2021-06-05 05:15:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 05:15:47,726 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 05:15:47,726 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 05:15:47,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 05:15:47,727 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 05:15:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 05:15:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2002098131, now seen corresponding path program 20 times [2021-06-05 05:15:47,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 05:15:47,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61981237] [2021-06-05 05:15:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 05:15:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 05:15:47,779 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 05:15:47,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 05:15:47,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61981237] [2021-06-05 05:15:47,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61981237] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 05:15:47,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 05:15:47,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 05:15:47,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390061402] [2021-06-05 05:15:47,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 05:15:47,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 05:15:47,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 05:15:47,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 05:15:47,781 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 05:15:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 05:15:47,890 INFO L93 Difference]: Finished difference Result 105 states and 189 transitions. [2021-06-05 05:15:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 05:15:47,891 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 05:15:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 05:15:47,891 INFO L225 Difference]: With dead ends: 105 [2021-06-05 05:15:47,891 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 05:15:47,891 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 63.1ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 05:15:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 05:15:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 05:15:47,892 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 05:15:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 05:15:47,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-06-05 05:15:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 05:15:47,892 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 05:15:47,892 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 05:15:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 05:15:47,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 05:15:47,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 05:15:47,894 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 05:15:47,896 INFO L202 PluginConnector]: Adding new model ticket-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 05:15:47 BasicIcfg [2021-06-05 05:15:47,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 05:15:47,897 INFO L168 Benchmark]: Toolchain (without parser) took 7007.27 ms. Allocated memory was 367.0 MB in the beginning and 520.1 MB in the end (delta: 153.1 MB). Free memory was 346.8 MB in the beginning and 222.9 MB in the end (delta: 123.9 MB). Peak memory consumption was 279.9 MB. Max. memory is 16.0 GB. [2021-06-05 05:15:47,897 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 367.0 MB. Free memory was 347.9 MB in the beginning and 347.8 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 05:15:47,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.55 ms. Allocated memory is still 367.0 MB. Free memory was 346.7 MB in the beginning and 345.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 05:15:47,897 INFO L168 Benchmark]: Boogie Preprocessor took 12.97 ms. Allocated memory is still 367.0 MB. Free memory was 345.2 MB in the beginning and 344.3 MB in the end (delta: 935.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 05:15:47,898 INFO L168 Benchmark]: RCFGBuilder took 264.49 ms. Allocated memory is still 367.0 MB. Free memory was 344.2 MB in the beginning and 330.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-05 05:15:47,898 INFO L168 Benchmark]: TraceAbstraction took 6700.65 ms. Allocated memory was 367.0 MB in the beginning and 520.1 MB in the end (delta: 153.1 MB). Free memory was 330.0 MB in the beginning and 222.9 MB in the end (delta: 107.1 MB). Peak memory consumption was 263.1 MB. Max. memory is 16.0 GB. [2021-06-05 05:15:47,898 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.16 ms. Allocated memory is still 367.0 MB. Free memory was 347.9 MB in the beginning and 347.8 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.55 ms. Allocated memory is still 367.0 MB. Free memory was 346.7 MB in the beginning and 345.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 12.97 ms. Allocated memory is still 367.0 MB. Free memory was 345.2 MB in the beginning and 344.3 MB in the end (delta: 935.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 264.49 ms. Allocated memory is still 367.0 MB. Free memory was 344.2 MB in the beginning and 330.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6700.65 ms. Allocated memory was 367.0 MB in the beginning and 520.1 MB in the end (delta: 153.1 MB). Free memory was 330.0 MB in the beginning and 222.9 MB in the end (delta: 107.1 MB). Peak memory consumption was 263.1 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: 6608.5ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 132.9ms, AutomataDifference: 3546.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 234.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1031 SDtfs, 1435 SDslu, 3418 SDs, 0 SdLazy, 3417 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1778.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 912.7ms 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: 1242.2ms AutomataMinimizationTime, 20 MinimizatonAttempts, 21600 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.4ms SsaConstructionTime, 155.5ms SatisfiabilityAnalysisTime, 1039.5ms 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...