/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:40:18,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:40:18,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:40:18,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:40:18,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:40:18,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:40:18,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:40:18,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:40:18,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:40:18,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:40:18,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:40:18,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:40:18,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:40:18,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:40:18,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:40:18,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:40:18,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:40:18,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:40:18,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:40:18,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:40:18,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:40:18,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:40:18,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:40:18,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:40:18,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:40:18,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:40:18,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:40:18,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:40:18,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:40:18,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:40:18,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:40:18,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:40:18,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:40:18,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:40:18,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:40:18,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:40:18,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:40:18,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:40:18,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:40:18,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:40:18,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:40:18,767 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-VariableLbe.epf [2020-02-10 20:40:18,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:40:18,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:40:18,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:40:18,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:40:18,793 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:40:18,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:40:18,793 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:40:18,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:40:18,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:40:18,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:40:18,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:40:18,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:40:18,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:40:18,799 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:40:18,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:40:18,799 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:40:18,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:40:18,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:40:18,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:40:18,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:40:18,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:40:18,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:40:18,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:40:18,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:40:18,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:40:18,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:40:18,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:40:18,805 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-02-10 20:40:18,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:40:18,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:40:19,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:40:19,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:40:19,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:40:19,080 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:40:19,080 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:40:19,081 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl [2020-02-10 20:40:19,081 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl' [2020-02-10 20:40:19,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:40:19,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:40:19,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:19,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:40:19,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:40:19,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:19,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:40:19,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:40:19,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:40:19,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/1) ... [2020-02-10 20:40:19,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:40:19,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:40:19,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:40:19,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:40:19,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (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 [2020-02-10 20:40:19,241 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:40:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:40:19,241 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:40:19,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:40:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:40:19,242 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:40:19,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:40:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:40:19,243 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:40:19,243 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:40:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:40:19,243 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:40:19,244 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:40:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:40:19,244 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:40:19,244 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:40:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:40:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:40:19,246 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:40:19,451 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:40:19,451 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:40:19,455 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:19 BoogieIcfgContainer [2020-02-10 20:40:19,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:40:19,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:40:19,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:40:19,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:40:19,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:19" (1/2) ... [2020-02-10 20:40:19,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8762bd and model type example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:40:19, skipping insertion in model container [2020-02-10 20:40:19,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:19" (2/2) ... [2020-02-10 20:40:19,475 INFO L109 eAbstractionObserver]: Analyzing ICFG example_5.bpl [2020-02-10 20:40:19,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:40:19,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:40:19,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:40:19,510 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:40:19,630 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-02-10 20:40:19,651 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:40:19,651 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:40:19,651 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:40:19,651 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:40:19,651 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:40:19,651 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:40:19,652 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:40:19,652 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:40:19,666 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 48 transitions [2020-02-10 20:40:19,668 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 48 transitions [2020-02-10 20:40:19,742 INFO L129 PetriNetUnfolder]: 49/98 cut-off events. [2020-02-10 20:40:19,743 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2020-02-10 20:40:19,751 INFO L76 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 98 events. 49/98 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 321 event pairs. 0/97 useless extension candidates. Maximal degree in co-relation 86. Up to 30 conditions per place. [2020-02-10 20:40:19,755 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 48 transitions [2020-02-10 20:40:19,793 INFO L129 PetriNetUnfolder]: 49/98 cut-off events. [2020-02-10 20:40:19,793 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2020-02-10 20:40:19,795 INFO L76 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 98 events. 49/98 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 321 event pairs. 0/97 useless extension candidates. Maximal degree in co-relation 86. Up to 30 conditions per place. [2020-02-10 20:40:19,798 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 440 [2020-02-10 20:40:19,799 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-02-10 20:40:19,917 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130 [2020-02-10 20:40:19,917 INFO L214 etLargeBlockEncoding]: Total number of compositions: 6 [2020-02-10 20:40:19,922 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 42 transitions [2020-02-10 20:40:19,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 276 states. [2020-02-10 20:40:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2020-02-10 20:40:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:19,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:19,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:19,988 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash 543435427, now seen corresponding path program 1 times [2020-02-10 20:40:20,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:20,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190924533] [2020-02-10 20:40:20,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:20,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190924533] [2020-02-10 20:40:20,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:20,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:20,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287903899] [2020-02-10 20:40:20,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:20,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,178 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 3 states. [2020-02-10 20:40:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:20,219 INFO L93 Difference]: Finished difference Result 228 states and 684 transitions. [2020-02-10 20:40:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:20,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:40:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:20,238 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:40:20,239 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:40:20,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:40:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2020-02-10 20:40:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-02-10 20:40:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 683 transitions. [2020-02-10 20:40:20,352 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 683 transitions. Word has length 16 [2020-02-10 20:40:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:20,354 INFO L479 AbstractCegarLoop]: Abstraction has 227 states and 683 transitions. [2020-02-10 20:40:20,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 683 transitions. [2020-02-10 20:40:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:20,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:20,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:20,358 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:20,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash 867723203, now seen corresponding path program 1 times [2020-02-10 20:40:20,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:20,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607560086] [2020-02-10 20:40:20,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:20,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607560086] [2020-02-10 20:40:20,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:20,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:20,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860388303] [2020-02-10 20:40:20,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:20,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:20,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:20,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,400 INFO L87 Difference]: Start difference. First operand 227 states and 683 transitions. Second operand 3 states. [2020-02-10 20:40:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:20,427 INFO L93 Difference]: Finished difference Result 211 states and 611 transitions. [2020-02-10 20:40:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:20,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:40:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:20,433 INFO L225 Difference]: With dead ends: 211 [2020-02-10 20:40:20,433 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 20:40:20,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 20:40:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-02-10 20:40:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:40:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 611 transitions. [2020-02-10 20:40:20,466 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 611 transitions. Word has length 16 [2020-02-10 20:40:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:20,467 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 611 transitions. [2020-02-10 20:40:20,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 611 transitions. [2020-02-10 20:40:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:20,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:20,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:20,478 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1800356309, now seen corresponding path program 1 times [2020-02-10 20:40:20,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:20,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101322934] [2020-02-10 20:40:20,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:20,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101322934] [2020-02-10 20:40:20,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:20,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:20,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301455181] [2020-02-10 20:40:20,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:20,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:20,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:20,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,530 INFO L87 Difference]: Start difference. First operand 211 states and 611 transitions. Second operand 3 states. [2020-02-10 20:40:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:20,551 INFO L93 Difference]: Finished difference Result 147 states and 391 transitions. [2020-02-10 20:40:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:20,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:40:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:20,554 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:40:20,555 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:40:20,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:40:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-02-10 20:40:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:40:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 391 transitions. [2020-02-10 20:40:20,574 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 391 transitions. Word has length 16 [2020-02-10 20:40:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:20,575 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 391 transitions. [2020-02-10 20:40:20,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 391 transitions. [2020-02-10 20:40:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:20,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:20,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:20,579 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash 536228197, now seen corresponding path program 1 times [2020-02-10 20:40:20,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:20,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792620106] [2020-02-10 20:40:20,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:20,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792620106] [2020-02-10 20:40:20,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:20,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:20,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925316866] [2020-02-10 20:40:20,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:20,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:20,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:20,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,623 INFO L87 Difference]: Start difference. First operand 147 states and 391 transitions. Second operand 3 states. [2020-02-10 20:40:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:20,631 INFO L93 Difference]: Finished difference Result 95 states and 241 transitions. [2020-02-10 20:40:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:20,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:40:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:20,633 INFO L225 Difference]: With dead ends: 95 [2020-02-10 20:40:20,633 INFO L226 Difference]: Without dead ends: 95 [2020-02-10 20:40:20,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-02-10 20:40:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-02-10 20:40:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:40:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-02-10 20:40:20,640 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 16 [2020-02-10 20:40:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:20,640 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-02-10 20:40:20,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-02-10 20:40:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:20,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:20,641 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:20,642 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1934968637, now seen corresponding path program 1 times [2020-02-10 20:40:20,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:20,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572360831] [2020-02-10 20:40:20,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:21,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572360831] [2020-02-10 20:40:21,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:21,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:21,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120316717] [2020-02-10 20:40:21,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:21,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:21,110 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 7 states. [2020-02-10 20:40:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:21,179 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-02-10 20:40:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:21,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:21,181 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:40:21,182 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:40:21,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:40:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2020-02-10 20:40:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-02-10 20:40:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 252 transitions. [2020-02-10 20:40:21,189 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 252 transitions. Word has length 16 [2020-02-10 20:40:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:21,189 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 252 transitions. [2020-02-10 20:40:21,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 252 transitions. [2020-02-10 20:40:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:21,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:21,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:21,191 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1391533921, now seen corresponding path program 2 times [2020-02-10 20:40:21,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:21,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787700196] [2020-02-10 20:40:21,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:21,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787700196] [2020-02-10 20:40:21,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:21,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:21,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247739749] [2020-02-10 20:40:21,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:21,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:21,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:21,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:21,494 INFO L87 Difference]: Start difference. First operand 100 states and 252 transitions. Second operand 7 states. [2020-02-10 20:40:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:21,553 INFO L93 Difference]: Finished difference Result 160 states and 334 transitions. [2020-02-10 20:40:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:21,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:21,555 INFO L225 Difference]: With dead ends: 160 [2020-02-10 20:40:21,555 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 20:40:21,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 20:40:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2020-02-10 20:40:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:40:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-02-10 20:40:21,561 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 16 [2020-02-10 20:40:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:21,562 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-02-10 20:40:21,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-02-10 20:40:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:21,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:21,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:21,563 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:21,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -870593663, now seen corresponding path program 3 times [2020-02-10 20:40:21,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:21,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285585229] [2020-02-10 20:40:21,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:21,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285585229] [2020-02-10 20:40:21,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:21,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:21,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070237849] [2020-02-10 20:40:21,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:21,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:21,817 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 7 states. [2020-02-10 20:40:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:21,883 INFO L93 Difference]: Finished difference Result 152 states and 319 transitions. [2020-02-10 20:40:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:21,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:21,886 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:40:21,887 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:40:21,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:40:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2020-02-10 20:40:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:40:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 248 transitions. [2020-02-10 20:40:21,894 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 248 transitions. Word has length 16 [2020-02-10 20:40:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:21,895 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 248 transitions. [2020-02-10 20:40:21,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 248 transitions. [2020-02-10 20:40:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:21,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:21,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:21,896 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2071878669, now seen corresponding path program 4 times [2020-02-10 20:40:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:21,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119350904] [2020-02-10 20:40:21,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:22,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119350904] [2020-02-10 20:40:22,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:22,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:22,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105942943] [2020-02-10 20:40:22,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:22,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:22,138 INFO L87 Difference]: Start difference. First operand 99 states and 248 transitions. Second operand 7 states. [2020-02-10 20:40:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:22,226 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 20:40:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:22,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:22,228 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:40:22,228 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:40:22,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:40:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2020-02-10 20:40:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:40:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 246 transitions. [2020-02-10 20:40:22,234 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 246 transitions. Word has length 16 [2020-02-10 20:40:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:22,235 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 246 transitions. [2020-02-10 20:40:22,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 246 transitions. [2020-02-10 20:40:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:22,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:22,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:22,236 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1881104299, now seen corresponding path program 5 times [2020-02-10 20:40:22,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:22,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369154362] [2020-02-10 20:40:22,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:22,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369154362] [2020-02-10 20:40:22,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:22,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:22,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912146545] [2020-02-10 20:40:22,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:22,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:22,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:22,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:22,494 INFO L87 Difference]: Start difference. First operand 98 states and 246 transitions. Second operand 7 states. [2020-02-10 20:40:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:22,548 INFO L93 Difference]: Finished difference Result 167 states and 348 transitions. [2020-02-10 20:40:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:22,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:22,550 INFO L225 Difference]: With dead ends: 167 [2020-02-10 20:40:22,550 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:40:22,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:40:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 104. [2020-02-10 20:40:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 20:40:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 255 transitions. [2020-02-10 20:40:22,556 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 255 transitions. Word has length 16 [2020-02-10 20:40:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:22,556 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 255 transitions. [2020-02-10 20:40:22,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 255 transitions. [2020-02-10 20:40:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:22,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:22,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:22,558 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1878970879, now seen corresponding path program 6 times [2020-02-10 20:40:22,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:22,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288115642] [2020-02-10 20:40:22,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:22,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288115642] [2020-02-10 20:40:22,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:22,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:22,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759388705] [2020-02-10 20:40:22,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:22,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:22,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:22,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:22,716 INFO L87 Difference]: Start difference. First operand 104 states and 255 transitions. Second operand 7 states. [2020-02-10 20:40:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:22,781 INFO L93 Difference]: Finished difference Result 165 states and 340 transitions. [2020-02-10 20:40:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:22,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:22,784 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:40:22,784 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 20:40:22,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 20:40:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2020-02-10 20:40:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:40:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 20:40:22,791 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 16 [2020-02-10 20:40:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:22,791 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 20:40:22,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 20:40:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:22,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:22,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:22,793 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1274477111, now seen corresponding path program 7 times [2020-02-10 20:40:22,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:22,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461291236] [2020-02-10 20:40:22,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:22,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461291236] [2020-02-10 20:40:22,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:22,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:22,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805289044] [2020-02-10 20:40:22,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:22,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:22,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:22,951 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 7 states. [2020-02-10 20:40:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:22,997 INFO L93 Difference]: Finished difference Result 151 states and 315 transitions. [2020-02-10 20:40:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:22,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:23,000 INFO L225 Difference]: With dead ends: 151 [2020-02-10 20:40:23,000 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:40:23,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:40:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 99. [2020-02-10 20:40:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:40:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 247 transitions. [2020-02-10 20:40:23,006 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 247 transitions. Word has length 16 [2020-02-10 20:40:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:23,006 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 247 transitions. [2020-02-10 20:40:23,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 247 transitions. [2020-02-10 20:40:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:23,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:23,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:23,007 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1817911827, now seen corresponding path program 8 times [2020-02-10 20:40:23,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:23,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640978900] [2020-02-10 20:40:23,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:23,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640978900] [2020-02-10 20:40:23,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:23,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:23,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542953456] [2020-02-10 20:40:23,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:23,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:23,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:23,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:23,177 INFO L87 Difference]: Start difference. First operand 99 states and 247 transitions. Second operand 7 states. [2020-02-10 20:40:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:23,242 INFO L93 Difference]: Finished difference Result 156 states and 323 transitions. [2020-02-10 20:40:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:23,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:23,245 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:40:23,245 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:40:23,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:40:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 97. [2020-02-10 20:40:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:40:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-02-10 20:40:23,250 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 16 [2020-02-10 20:40:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:23,250 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-02-10 20:40:23,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-02-10 20:40:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:23,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:23,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:23,252 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:23,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1531085189, now seen corresponding path program 9 times [2020-02-10 20:40:23,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:23,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207113922] [2020-02-10 20:40:23,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:23,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207113922] [2020-02-10 20:40:23,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:23,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:23,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499881406] [2020-02-10 20:40:23,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:23,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:23,419 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 7 states. [2020-02-10 20:40:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:23,471 INFO L93 Difference]: Finished difference Result 147 states and 306 transitions. [2020-02-10 20:40:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:23,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:23,473 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:40:23,473 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:40:23,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:40:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2020-02-10 20:40:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:40:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 243 transitions. [2020-02-10 20:40:23,478 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 243 transitions. Word has length 16 [2020-02-10 20:40:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:23,479 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 243 transitions. [2020-02-10 20:40:23,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 243 transitions. [2020-02-10 20:40:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:23,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:23,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:23,480 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash 675778535, now seen corresponding path program 10 times [2020-02-10 20:40:23,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:23,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209883670] [2020-02-10 20:40:23,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:23,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209883670] [2020-02-10 20:40:23,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:23,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:23,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379941251] [2020-02-10 20:40:23,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:23,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:23,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:23,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:23,619 INFO L87 Difference]: Start difference. First operand 98 states and 243 transitions. Second operand 7 states. [2020-02-10 20:40:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:23,678 INFO L93 Difference]: Finished difference Result 149 states and 309 transitions. [2020-02-10 20:40:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:23,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:23,681 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:40:23,681 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:40:23,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:40:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2020-02-10 20:40:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:40:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-02-10 20:40:23,687 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 16 [2020-02-10 20:40:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:23,687 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-02-10 20:40:23,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-02-10 20:40:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:23,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:23,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:23,689 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1732352971, now seen corresponding path program 11 times [2020-02-10 20:40:23,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:23,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219400419] [2020-02-10 20:40:23,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:23,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219400419] [2020-02-10 20:40:23,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:23,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:23,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910474849] [2020-02-10 20:40:23,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:23,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:23,846 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 7 states. [2020-02-10 20:40:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:23,891 INFO L93 Difference]: Finished difference Result 160 states and 331 transitions. [2020-02-10 20:40:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:23,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:23,892 INFO L225 Difference]: With dead ends: 160 [2020-02-10 20:40:23,893 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:40:23,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:40:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 101. [2020-02-10 20:40:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 20:40:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 247 transitions. [2020-02-10 20:40:23,898 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 247 transitions. Word has length 16 [2020-02-10 20:40:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:23,899 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 247 transitions. [2020-02-10 20:40:23,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 247 transitions. [2020-02-10 20:40:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:23,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:23,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:23,900 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:23,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1636870967, now seen corresponding path program 12 times [2020-02-10 20:40:23,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:23,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063082489] [2020-02-10 20:40:23,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:24,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063082489] [2020-02-10 20:40:24,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:24,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:24,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298161412] [2020-02-10 20:40:24,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:24,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:24,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:24,044 INFO L87 Difference]: Start difference. First operand 101 states and 247 transitions. Second operand 7 states. [2020-02-10 20:40:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:24,095 INFO L93 Difference]: Finished difference Result 157 states and 322 transitions. [2020-02-10 20:40:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:24,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:24,097 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:40:24,097 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:40:24,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:40:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2020-02-10 20:40:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:40:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 236 transitions. [2020-02-10 20:40:24,102 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 236 transitions. Word has length 16 [2020-02-10 20:40:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:24,103 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 236 transitions. [2020-02-10 20:40:24,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 236 transitions. [2020-02-10 20:40:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:24,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:24,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:24,104 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:24,104 INFO L82 PathProgramCache]: Analyzing trace with hash -858157495, now seen corresponding path program 13 times [2020-02-10 20:40:24,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:24,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246101119] [2020-02-10 20:40:24,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:24,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246101119] [2020-02-10 20:40:24,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:24,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:24,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701863123] [2020-02-10 20:40:24,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:24,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:24,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:24,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:24,267 INFO L87 Difference]: Start difference. First operand 95 states and 236 transitions. Second operand 7 states. [2020-02-10 20:40:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:24,320 INFO L93 Difference]: Finished difference Result 143 states and 298 transitions. [2020-02-10 20:40:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:24,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:24,322 INFO L225 Difference]: With dead ends: 143 [2020-02-10 20:40:24,322 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:40:24,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:40:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 97. [2020-02-10 20:40:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:40:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 240 transitions. [2020-02-10 20:40:24,327 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 240 transitions. Word has length 16 [2020-02-10 20:40:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:24,328 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 240 transitions. [2020-02-10 20:40:24,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 240 transitions. [2020-02-10 20:40:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:24,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:24,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:24,329 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2084314837, now seen corresponding path program 14 times [2020-02-10 20:40:24,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:24,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774450441] [2020-02-10 20:40:24,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:24,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774450441] [2020-02-10 20:40:24,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:24,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:24,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437191642] [2020-02-10 20:40:24,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:24,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:24,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:24,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:24,555 INFO L87 Difference]: Start difference. First operand 97 states and 240 transitions. Second operand 7 states. [2020-02-10 20:40:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:24,639 INFO L93 Difference]: Finished difference Result 146 states and 303 transitions. [2020-02-10 20:40:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:24,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:24,642 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:40:24,642 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:40:24,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:40:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2020-02-10 20:40:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-02-10 20:40:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 238 transitions. [2020-02-10 20:40:24,647 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 238 transitions. Word has length 16 [2020-02-10 20:40:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:24,648 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 238 transitions. [2020-02-10 20:40:24,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 238 transitions. [2020-02-10 20:40:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:24,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:24,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:24,649 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:24,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 457999809, now seen corresponding path program 15 times [2020-02-10 20:40:24,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:24,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457960232] [2020-02-10 20:40:24,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457960232] [2020-02-10 20:40:24,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:24,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:24,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189607338] [2020-02-10 20:40:24,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:24,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:24,802 INFO L87 Difference]: Start difference. First operand 96 states and 238 transitions. Second operand 7 states. [2020-02-10 20:40:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:24,852 INFO L93 Difference]: Finished difference Result 142 states and 295 transitions. [2020-02-10 20:40:24,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:24,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:24,854 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:40:24,854 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:40:24,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:40:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2020-02-10 20:40:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:40:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 239 transitions. [2020-02-10 20:40:24,860 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 239 transitions. Word has length 16 [2020-02-10 20:40:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:24,860 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 239 transitions. [2020-02-10 20:40:24,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 239 transitions. [2020-02-10 20:40:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:24,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:24,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:24,861 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash -397306845, now seen corresponding path program 16 times [2020-02-10 20:40:24,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:24,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298654457] [2020-02-10 20:40:24,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:25,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298654457] [2020-02-10 20:40:25,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:25,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:25,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906344405] [2020-02-10 20:40:25,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:25,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:25,021 INFO L87 Difference]: Start difference. First operand 97 states and 239 transitions. Second operand 7 states. [2020-02-10 20:40:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:25,104 INFO L93 Difference]: Finished difference Result 144 states and 298 transitions. [2020-02-10 20:40:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:25,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:25,106 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:40:25,106 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:40:25,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:40:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-02-10 20:40:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-02-10 20:40:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 237 transitions. [2020-02-10 20:40:25,111 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 237 transitions. Word has length 16 [2020-02-10 20:40:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:25,111 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 237 transitions. [2020-02-10 20:40:25,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 237 transitions. [2020-02-10 20:40:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:25,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:25,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:25,112 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1339612339, now seen corresponding path program 17 times [2020-02-10 20:40:25,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:25,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263842654] [2020-02-10 20:40:25,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:25,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263842654] [2020-02-10 20:40:25,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:25,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:25,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408237067] [2020-02-10 20:40:25,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:25,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:25,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:25,270 INFO L87 Difference]: Start difference. First operand 96 states and 237 transitions. Second operand 7 states. [2020-02-10 20:40:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:25,348 INFO L93 Difference]: Finished difference Result 150 states and 312 transitions. [2020-02-10 20:40:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:25,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:25,350 INFO L225 Difference]: With dead ends: 150 [2020-02-10 20:40:25,351 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:40:25,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:40:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2020-02-10 20:40:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:40:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 242 transitions. [2020-02-10 20:40:25,356 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 242 transitions. Word has length 16 [2020-02-10 20:40:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:25,357 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 242 transitions. [2020-02-10 20:40:25,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 242 transitions. [2020-02-10 20:40:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:25,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:25,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:25,358 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:25,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:25,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2087156279, now seen corresponding path program 18 times [2020-02-10 20:40:25,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:25,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261151329] [2020-02-10 20:40:25,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:25,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261151329] [2020-02-10 20:40:25,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:25,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:25,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230181558] [2020-02-10 20:40:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:25,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:25,538 INFO L87 Difference]: Start difference. First operand 99 states and 242 transitions. Second operand 7 states. [2020-02-10 20:40:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:25,613 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-02-10 20:40:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:25,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:25,615 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:40:25,615 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:40:25,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:40:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2020-02-10 20:40:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:40:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 235 transitions. [2020-02-10 20:40:25,621 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 235 transitions. Word has length 16 [2020-02-10 20:40:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:25,622 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 235 transitions. [2020-02-10 20:40:25,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 235 transitions. [2020-02-10 20:40:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:25,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:25,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:25,623 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:25,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:25,624 INFO L82 PathProgramCache]: Analyzing trace with hash -257727173, now seen corresponding path program 19 times [2020-02-10 20:40:25,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:25,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129403732] [2020-02-10 20:40:25,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:25,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129403732] [2020-02-10 20:40:25,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:25,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:25,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898607040] [2020-02-10 20:40:25,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:25,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:25,788 INFO L87 Difference]: Start difference. First operand 95 states and 235 transitions. Second operand 7 states. [2020-02-10 20:40:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:25,832 INFO L93 Difference]: Finished difference Result 176 states and 370 transitions. [2020-02-10 20:40:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:25,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:25,834 INFO L225 Difference]: With dead ends: 176 [2020-02-10 20:40:25,834 INFO L226 Difference]: Without dead ends: 164 [2020-02-10 20:40:25,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-02-10 20:40:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 107. [2020-02-10 20:40:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-02-10 20:40:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 261 transitions. [2020-02-10 20:40:25,840 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 261 transitions. Word has length 16 [2020-02-10 20:40:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:25,840 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 261 transitions. [2020-02-10 20:40:25,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 261 transitions. [2020-02-10 20:40:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:25,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:25,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:25,842 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash -255593753, now seen corresponding path program 20 times [2020-02-10 20:40:25,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:25,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818038645] [2020-02-10 20:40:25,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:25,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818038645] [2020-02-10 20:40:25,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:25,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:25,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973073413] [2020-02-10 20:40:25,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:25,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:25,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:25,983 INFO L87 Difference]: Start difference. First operand 107 states and 261 transitions. Second operand 7 states. [2020-02-10 20:40:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,041 INFO L93 Difference]: Finished difference Result 174 states and 362 transitions. [2020-02-10 20:40:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:26,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,042 INFO L225 Difference]: With dead ends: 174 [2020-02-10 20:40:26,042 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:40:26,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:40:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2020-02-10 20:40:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 20:40:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 247 transitions. [2020-02-10 20:40:26,047 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 247 transitions. Word has length 16 [2020-02-10 20:40:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,048 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 247 transitions. [2020-02-10 20:40:26,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 247 transitions. [2020-02-10 20:40:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:26,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,049 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,049 INFO L82 PathProgramCache]: Analyzing trace with hash 886628069, now seen corresponding path program 21 times [2020-02-10 20:40:26,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189369064] [2020-02-10 20:40:26,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:26,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189369064] [2020-02-10 20:40:26,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:26,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:26,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858656658] [2020-02-10 20:40:26,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:26,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:26,212 INFO L87 Difference]: Start difference. First operand 101 states and 247 transitions. Second operand 7 states. [2020-02-10 20:40:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,260 INFO L93 Difference]: Finished difference Result 173 states and 359 transitions. [2020-02-10 20:40:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:26,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,262 INFO L225 Difference]: With dead ends: 173 [2020-02-10 20:40:26,262 INFO L226 Difference]: Without dead ends: 161 [2020-02-10 20:40:26,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-02-10 20:40:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2020-02-10 20:40:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-02-10 20:40:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 253 transitions. [2020-02-10 20:40:26,267 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 253 transitions. Word has length 16 [2020-02-10 20:40:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,267 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 253 transitions. [2020-02-10 20:40:26,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 253 transitions. [2020-02-10 20:40:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:26,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,268 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash 847649909, now seen corresponding path program 22 times [2020-02-10 20:40:26,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337299417] [2020-02-10 20:40:26,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:26,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337299417] [2020-02-10 20:40:26,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:26,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:26,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782106492] [2020-02-10 20:40:26,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:26,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:26,415 INFO L87 Difference]: Start difference. First operand 105 states and 253 transitions. Second operand 7 states. [2020-02-10 20:40:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,477 INFO L93 Difference]: Finished difference Result 170 states and 350 transitions. [2020-02-10 20:40:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:26,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,479 INFO L225 Difference]: With dead ends: 170 [2020-02-10 20:40:26,479 INFO L226 Difference]: Without dead ends: 157 [2020-02-10 20:40:26,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-02-10 20:40:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2020-02-10 20:40:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 20:40:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 243 transitions. [2020-02-10 20:40:26,484 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 243 transitions. Word has length 16 [2020-02-10 20:40:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,484 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 243 transitions. [2020-02-10 20:40:26,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 243 transitions. [2020-02-10 20:40:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:26,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,485 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1633045487, now seen corresponding path program 23 times [2020-02-10 20:40:26,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951224924] [2020-02-10 20:40:26,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:26,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951224924] [2020-02-10 20:40:26,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:26,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:26,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995642488] [2020-02-10 20:40:26,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:26,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:26,656 INFO L87 Difference]: Start difference. First operand 101 states and 243 transitions. Second operand 7 states. [2020-02-10 20:40:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,716 INFO L93 Difference]: Finished difference Result 168 states and 347 transitions. [2020-02-10 20:40:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:26,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,718 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:40:26,718 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:40:26,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:40:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 104. [2020-02-10 20:40:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 20:40:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 248 transitions. [2020-02-10 20:40:26,724 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 248 transitions. Word has length 16 [2020-02-10 20:40:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,724 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 248 transitions. [2020-02-10 20:40:26,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 248 transitions. [2020-02-10 20:40:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:26,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,725 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1729568327, now seen corresponding path program 24 times [2020-02-10 20:40:26,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104786308] [2020-02-10 20:40:26,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:26,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104786308] [2020-02-10 20:40:26,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:26,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:26,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330116910] [2020-02-10 20:40:26,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:26,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:26,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:26,872 INFO L87 Difference]: Start difference. First operand 104 states and 248 transitions. Second operand 7 states. [2020-02-10 20:40:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:26,930 INFO L93 Difference]: Finished difference Result 167 states and 342 transitions. [2020-02-10 20:40:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:26,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:26,931 INFO L225 Difference]: With dead ends: 167 [2020-02-10 20:40:26,932 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:40:26,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:40:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2020-02-10 20:40:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:40:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 224 transitions. [2020-02-10 20:40:26,936 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 224 transitions. Word has length 16 [2020-02-10 20:40:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:26,936 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 224 transitions. [2020-02-10 20:40:26,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 224 transitions. [2020-02-10 20:40:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:26,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:26,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:26,937 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1892241251, now seen corresponding path program 25 times [2020-02-10 20:40:26,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:26,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516854572] [2020-02-10 20:40:26,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:27,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516854572] [2020-02-10 20:40:27,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:27,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:27,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664215123] [2020-02-10 20:40:27,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:27,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:27,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:27,075 INFO L87 Difference]: Start difference. First operand 91 states and 224 transitions. Second operand 7 states. [2020-02-10 20:40:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:27,114 INFO L93 Difference]: Finished difference Result 148 states and 301 transitions. [2020-02-10 20:40:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:27,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:27,115 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:40:27,115 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:40:27,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:40:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2020-02-10 20:40:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:40:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 227 transitions. [2020-02-10 20:40:27,119 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 227 transitions. Word has length 16 [2020-02-10 20:40:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:27,120 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 227 transitions. [2020-02-10 20:40:27,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 227 transitions. [2020-02-10 20:40:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:27,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:27,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:27,121 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:27,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1348806535, now seen corresponding path program 26 times [2020-02-10 20:40:27,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:27,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121204557] [2020-02-10 20:40:27,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:27,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121204557] [2020-02-10 20:40:27,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:27,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:27,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692876910] [2020-02-10 20:40:27,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:27,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:27,284 INFO L87 Difference]: Start difference. First operand 93 states and 227 transitions. Second operand 7 states. [2020-02-10 20:40:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:27,351 INFO L93 Difference]: Finished difference Result 153 states and 309 transitions. [2020-02-10 20:40:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:27,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:27,353 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:40:27,353 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:40:27,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:40:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2020-02-10 20:40:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:40:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 222 transitions. [2020-02-10 20:40:27,359 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 222 transitions. Word has length 16 [2020-02-10 20:40:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:27,359 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 222 transitions. [2020-02-10 20:40:27,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 222 transitions. [2020-02-10 20:40:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:27,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:27,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:27,360 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash -913321049, now seen corresponding path program 27 times [2020-02-10 20:40:27,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:27,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375841215] [2020-02-10 20:40:27,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:27,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375841215] [2020-02-10 20:40:27,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:27,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:27,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762904486] [2020-02-10 20:40:27,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:27,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:27,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:27,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:27,615 INFO L87 Difference]: Start difference. First operand 91 states and 222 transitions. Second operand 7 states. [2020-02-10 20:40:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:27,668 INFO L93 Difference]: Finished difference Result 145 states and 294 transitions. [2020-02-10 20:40:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:27,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:27,670 INFO L225 Difference]: With dead ends: 145 [2020-02-10 20:40:27,670 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:40:27,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:40:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2020-02-10 20:40:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:40:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 223 transitions. [2020-02-10 20:40:27,675 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 223 transitions. Word has length 16 [2020-02-10 20:40:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:27,676 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 223 transitions. [2020-02-10 20:40:27,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 223 transitions. [2020-02-10 20:40:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:27,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:27,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:27,677 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2029151283, now seen corresponding path program 28 times [2020-02-10 20:40:27,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:27,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078928585] [2020-02-10 20:40:27,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:27,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078928585] [2020-02-10 20:40:27,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:27,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:27,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001078031] [2020-02-10 20:40:27,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:27,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:27,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:27,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:27,833 INFO L87 Difference]: Start difference. First operand 92 states and 223 transitions. Second operand 7 states. [2020-02-10 20:40:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:27,894 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-02-10 20:40:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:27,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:27,895 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:40:27,896 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:40:27,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:40:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 20:40:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:40:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 221 transitions. [2020-02-10 20:40:27,900 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 221 transitions. Word has length 16 [2020-02-10 20:40:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:27,900 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 221 transitions. [2020-02-10 20:40:27,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 221 transitions. [2020-02-10 20:40:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:27,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:27,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:27,901 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1923831685, now seen corresponding path program 29 times [2020-02-10 20:40:27,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:27,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433478850] [2020-02-10 20:40:27,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433478850] [2020-02-10 20:40:28,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:28,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720567446] [2020-02-10 20:40:28,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:28,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:28,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:28,058 INFO L87 Difference]: Start difference. First operand 91 states and 221 transitions. Second operand 7 states. [2020-02-10 20:40:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,099 INFO L93 Difference]: Finished difference Result 160 states and 323 transitions. [2020-02-10 20:40:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:28,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,100 INFO L225 Difference]: With dead ends: 160 [2020-02-10 20:40:28,100 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:40:28,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:40:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2020-02-10 20:40:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:40:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 230 transitions. [2020-02-10 20:40:28,108 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 230 transitions. Word has length 16 [2020-02-10 20:40:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,109 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 230 transitions. [2020-02-10 20:40:28,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 230 transitions. [2020-02-10 20:40:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:28,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,110 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1921698265, now seen corresponding path program 30 times [2020-02-10 20:40:28,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778880857] [2020-02-10 20:40:28,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778880857] [2020-02-10 20:40:28,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:28,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987004396] [2020-02-10 20:40:28,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:28,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:28,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:28,264 INFO L87 Difference]: Start difference. First operand 97 states and 230 transitions. Second operand 7 states. [2020-02-10 20:40:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,323 INFO L93 Difference]: Finished difference Result 158 states and 315 transitions. [2020-02-10 20:40:28,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:28,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,324 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:40:28,325 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:40:28,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:40:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 88. [2020-02-10 20:40:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:40:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 213 transitions. [2020-02-10 20:40:28,332 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 213 transitions. Word has length 16 [2020-02-10 20:40:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,332 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 213 transitions. [2020-02-10 20:40:28,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 213 transitions. [2020-02-10 20:40:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:28,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,333 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash -224453179, now seen corresponding path program 31 times [2020-02-10 20:40:28,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912021185] [2020-02-10 20:40:28,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912021185] [2020-02-10 20:40:28,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:28,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938395147] [2020-02-10 20:40:28,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:28,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:28,483 INFO L87 Difference]: Start difference. First operand 88 states and 213 transitions. Second operand 7 states. [2020-02-10 20:40:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,524 INFO L93 Difference]: Finished difference Result 140 states and 281 transitions. [2020-02-10 20:40:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:28,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,525 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:40:28,525 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:40:28,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:40:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2020-02-10 20:40:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:40:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 222 transitions. [2020-02-10 20:40:28,529 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 222 transitions. Word has length 16 [2020-02-10 20:40:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,529 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 222 transitions. [2020-02-10 20:40:28,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 222 transitions. [2020-02-10 20:40:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:28,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,530 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,531 INFO L82 PathProgramCache]: Analyzing trace with hash -767887895, now seen corresponding path program 32 times [2020-02-10 20:40:28,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428537773] [2020-02-10 20:40:28,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428537773] [2020-02-10 20:40:28,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:28,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836006255] [2020-02-10 20:40:28,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:28,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:28,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:28,668 INFO L87 Difference]: Start difference. First operand 92 states and 222 transitions. Second operand 7 states. [2020-02-10 20:40:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,714 INFO L93 Difference]: Finished difference Result 145 states and 289 transitions. [2020-02-10 20:40:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:28,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,716 INFO L225 Difference]: With dead ends: 145 [2020-02-10 20:40:28,716 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:40:28,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:40:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2020-02-10 20:40:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:40:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 217 transitions. [2020-02-10 20:40:28,719 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 217 transitions. Word has length 16 [2020-02-10 20:40:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,720 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 217 transitions. [2020-02-10 20:40:28,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 217 transitions. [2020-02-10 20:40:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:28,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,721 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2009654315, now seen corresponding path program 33 times [2020-02-10 20:40:28,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356621367] [2020-02-10 20:40:28,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356621367] [2020-02-10 20:40:28,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:28,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524282976] [2020-02-10 20:40:28,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:28,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:28,893 INFO L87 Difference]: Start difference. First operand 90 states and 217 transitions. Second operand 7 states. [2020-02-10 20:40:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:28,950 INFO L93 Difference]: Finished difference Result 134 states and 269 transitions. [2020-02-10 20:40:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:28,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:28,951 INFO L225 Difference]: With dead ends: 134 [2020-02-10 20:40:28,952 INFO L226 Difference]: Without dead ends: 127 [2020-02-10 20:40:28,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-02-10 20:40:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2020-02-10 20:40:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:40:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 218 transitions. [2020-02-10 20:40:28,956 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 218 transitions. Word has length 16 [2020-02-10 20:40:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:28,957 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 218 transitions. [2020-02-10 20:40:28,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 218 transitions. [2020-02-10 20:40:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:28,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:28,958 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1438331371, now seen corresponding path program 34 times [2020-02-10 20:40:28,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480893827] [2020-02-10 20:40:28,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:29,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480893827] [2020-02-10 20:40:29,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:29,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:29,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877769899] [2020-02-10 20:40:29,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:29,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:29,127 INFO L87 Difference]: Start difference. First operand 91 states and 218 transitions. Second operand 7 states. [2020-02-10 20:40:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,186 INFO L93 Difference]: Finished difference Result 128 states and 264 transitions. [2020-02-10 20:40:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:29,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,188 INFO L225 Difference]: With dead ends: 128 [2020-02-10 20:40:29,188 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:40:29,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:40:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2020-02-10 20:40:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:40:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 216 transitions. [2020-02-10 20:40:29,191 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 216 transitions. Word has length 16 [2020-02-10 20:40:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:29,192 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 216 transitions. [2020-02-10 20:40:29,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 216 transitions. [2020-02-10 20:40:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:29,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:29,192 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:29,193 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash -281261761, now seen corresponding path program 35 times [2020-02-10 20:40:29,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:29,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318268737] [2020-02-10 20:40:29,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:29,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318268737] [2020-02-10 20:40:29,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:29,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:29,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376732663] [2020-02-10 20:40:29,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:29,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:29,341 INFO L87 Difference]: Start difference. First operand 90 states and 216 transitions. Second operand 7 states. [2020-02-10 20:40:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,386 INFO L93 Difference]: Finished difference Result 141 states and 282 transitions. [2020-02-10 20:40:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:29,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,387 INFO L225 Difference]: With dead ends: 141 [2020-02-10 20:40:29,388 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:40:29,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:40:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2020-02-10 20:40:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:40:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 220 transitions. [2020-02-10 20:40:29,393 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 220 transitions. Word has length 16 [2020-02-10 20:40:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:29,393 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 220 transitions. [2020-02-10 20:40:29,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 220 transitions. [2020-02-10 20:40:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:29,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:29,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:29,394 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1456765397, now seen corresponding path program 36 times [2020-02-10 20:40:29,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:29,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760581423] [2020-02-10 20:40:29,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:29,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760581423] [2020-02-10 20:40:29,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:29,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:29,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827727493] [2020-02-10 20:40:29,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:29,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:29,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:29,533 INFO L87 Difference]: Start difference. First operand 93 states and 220 transitions. Second operand 7 states. [2020-02-10 20:40:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,600 INFO L93 Difference]: Finished difference Result 130 states and 266 transitions. [2020-02-10 20:40:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:29,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,601 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:40:29,601 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:40:29,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:40:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2020-02-10 20:40:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:40:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-02-10 20:40:29,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 16 [2020-02-10 20:40:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:29,604 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-02-10 20:40:29,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-02-10 20:40:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:29,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:29,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:29,606 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:29,606 INFO L82 PathProgramCache]: Analyzing trace with hash 191866437, now seen corresponding path program 37 times [2020-02-10 20:40:29,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:29,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635932893] [2020-02-10 20:40:29,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:29,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635932893] [2020-02-10 20:40:29,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:29,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:29,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264157681] [2020-02-10 20:40:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:29,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:29,763 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 7 states. [2020-02-10 20:40:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,808 INFO L93 Difference]: Finished difference Result 133 states and 266 transitions. [2020-02-10 20:40:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:29,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,810 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:40:29,810 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:40:29,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:40:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2020-02-10 20:40:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:40:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 215 transitions. [2020-02-10 20:40:29,814 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 215 transitions. Word has length 16 [2020-02-10 20:40:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:29,814 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 215 transitions. [2020-02-10 20:40:29,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 215 transitions. [2020-02-10 20:40:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:29,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:29,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:29,815 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1160628527, now seen corresponding path program 38 times [2020-02-10 20:40:29,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:29,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275727960] [2020-02-10 20:40:29,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:29,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275727960] [2020-02-10 20:40:29,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:29,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:29,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779193135] [2020-02-10 20:40:29,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:29,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:29,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:29,943 INFO L87 Difference]: Start difference. First operand 90 states and 215 transitions. Second operand 7 states. [2020-02-10 20:40:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,998 INFO L93 Difference]: Finished difference Result 136 states and 271 transitions. [2020-02-10 20:40:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:29,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,999 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:40:29,999 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:40:30,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:40:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2020-02-10 20:40:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:40:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 213 transitions. [2020-02-10 20:40:30,003 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 213 transitions. Word has length 16 [2020-02-10 20:40:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,003 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 213 transitions. [2020-02-10 20:40:30,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 213 transitions. [2020-02-10 20:40:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:30,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,005 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash 936568935, now seen corresponding path program 39 times [2020-02-10 20:40:30,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956816141] [2020-02-10 20:40:30,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956816141] [2020-02-10 20:40:30,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:30,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730689443] [2020-02-10 20:40:30,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:30,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:30,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:30,158 INFO L87 Difference]: Start difference. First operand 89 states and 213 transitions. Second operand 7 states. [2020-02-10 20:40:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,211 INFO L93 Difference]: Finished difference Result 130 states and 260 transitions. [2020-02-10 20:40:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:30,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,212 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:40:30,213 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:40:30,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:40:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2020-02-10 20:40:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:40:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 214 transitions. [2020-02-10 20:40:30,217 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 214 transitions. Word has length 16 [2020-02-10 20:40:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,217 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 214 transitions. [2020-02-10 20:40:30,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 214 transitions. [2020-02-10 20:40:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:30,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,218 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1783550545, now seen corresponding path program 40 times [2020-02-10 20:40:30,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165943112] [2020-02-10 20:40:30,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165943112] [2020-02-10 20:40:30,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:30,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528528276] [2020-02-10 20:40:30,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:30,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:30,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:30,388 INFO L87 Difference]: Start difference. First operand 90 states and 214 transitions. Second operand 7 states. [2020-02-10 20:40:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,456 INFO L93 Difference]: Finished difference Result 124 states and 255 transitions. [2020-02-10 20:40:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:30,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,458 INFO L225 Difference]: With dead ends: 124 [2020-02-10 20:40:30,458 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 20:40:30,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 20:40:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2020-02-10 20:40:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:40:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 212 transitions. [2020-02-10 20:40:30,462 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 212 transitions. Word has length 16 [2020-02-10 20:40:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,462 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 212 transitions. [2020-02-10 20:40:30,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 212 transitions. [2020-02-10 20:40:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:30,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,463 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -674002393, now seen corresponding path program 41 times [2020-02-10 20:40:30,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479264011] [2020-02-10 20:40:30,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479264011] [2020-02-10 20:40:30,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:30,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745475157] [2020-02-10 20:40:30,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:30,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:30,583 INFO L87 Difference]: Start difference. First operand 89 states and 212 transitions. Second operand 7 states. [2020-02-10 20:40:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,655 INFO L93 Difference]: Finished difference Result 134 states and 268 transitions. [2020-02-10 20:40:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:30,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,656 INFO L225 Difference]: With dead ends: 134 [2020-02-10 20:40:30,656 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:40:30,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:40:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2020-02-10 20:40:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:40:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 215 transitions. [2020-02-10 20:40:30,661 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 215 transitions. Word has length 16 [2020-02-10 20:40:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,662 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 215 transitions. [2020-02-10 20:40:30,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 215 transitions. [2020-02-10 20:40:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:30,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,663 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash 670167527, now seen corresponding path program 42 times [2020-02-10 20:40:30,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901574619] [2020-02-10 20:40:30,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901574619] [2020-02-10 20:40:30,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:30,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456355102] [2020-02-10 20:40:30,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:30,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:30,794 INFO L87 Difference]: Start difference. First operand 91 states and 215 transitions. Second operand 7 states. [2020-02-10 20:40:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,859 INFO L93 Difference]: Finished difference Result 125 states and 256 transitions. [2020-02-10 20:40:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:30,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,860 INFO L225 Difference]: With dead ends: 125 [2020-02-10 20:40:30,861 INFO L226 Difference]: Without dead ends: 114 [2020-02-10 20:40:30,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-02-10 20:40:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2020-02-10 20:40:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:40:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 210 transitions. [2020-02-10 20:40:30,866 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 210 transitions. Word has length 16 [2020-02-10 20:40:30,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,866 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 210 transitions. [2020-02-10 20:40:30,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 210 transitions. [2020-02-10 20:40:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:30,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,867 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash 844008489, now seen corresponding path program 43 times [2020-02-10 20:40:30,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665585200] [2020-02-10 20:40:30,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665585200] [2020-02-10 20:40:31,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:31,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664946619] [2020-02-10 20:40:31,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:31,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:31,027 INFO L87 Difference]: Start difference. First operand 88 states and 210 transitions. Second operand 7 states. [2020-02-10 20:40:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,085 INFO L93 Difference]: Finished difference Result 158 states and 318 transitions. [2020-02-10 20:40:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:31,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,087 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:40:31,087 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 20:40:31,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 20:40:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2020-02-10 20:40:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:40:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 231 transitions. [2020-02-10 20:40:31,091 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 231 transitions. Word has length 16 [2020-02-10 20:40:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,091 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 231 transitions. [2020-02-10 20:40:31,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 231 transitions. [2020-02-10 20:40:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:31,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,093 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,093 INFO L82 PathProgramCache]: Analyzing trace with hash 846141909, now seen corresponding path program 44 times [2020-02-10 20:40:31,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447233192] [2020-02-10 20:40:31,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447233192] [2020-02-10 20:40:31,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:31,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441915565] [2020-02-10 20:40:31,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:31,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:31,273 INFO L87 Difference]: Start difference. First operand 98 states and 231 transitions. Second operand 7 states. [2020-02-10 20:40:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,324 INFO L93 Difference]: Finished difference Result 156 states and 310 transitions. [2020-02-10 20:40:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:31,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,326 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:40:31,326 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:40:31,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:40:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2020-02-10 20:40:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:40:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 218 transitions. [2020-02-10 20:40:31,330 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 218 transitions. Word has length 16 [2020-02-10 20:40:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,330 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 218 transitions. [2020-02-10 20:40:31,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 218 transitions. [2020-02-10 20:40:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:31,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,331 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash -436396951, now seen corresponding path program 45 times [2020-02-10 20:40:31,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998194738] [2020-02-10 20:40:31,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998194738] [2020-02-10 20:40:31,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:31,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767061748] [2020-02-10 20:40:31,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:31,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:31,471 INFO L87 Difference]: Start difference. First operand 92 states and 218 transitions. Second operand 7 states. [2020-02-10 20:40:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,509 INFO L93 Difference]: Finished difference Result 147 states and 293 transitions. [2020-02-10 20:40:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:31,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,511 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:40:31,511 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:40:31,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:40:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2020-02-10 20:40:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:40:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 222 transitions. [2020-02-10 20:40:31,515 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 222 transitions. Word has length 16 [2020-02-10 20:40:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,515 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 222 transitions. [2020-02-10 20:40:31,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 222 transitions. [2020-02-10 20:40:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:31,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,516 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1611900587, now seen corresponding path program 46 times [2020-02-10 20:40:31,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217696315] [2020-02-10 20:40:31,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217696315] [2020-02-10 20:40:31,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:31,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569600183] [2020-02-10 20:40:31,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:31,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:31,659 INFO L87 Difference]: Start difference. First operand 95 states and 222 transitions. Second operand 7 states. [2020-02-10 20:40:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,720 INFO L93 Difference]: Finished difference Result 136 states and 277 transitions. [2020-02-10 20:40:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:31,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,722 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:40:31,722 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:40:31,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:40:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2020-02-10 20:40:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:40:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 215 transitions. [2020-02-10 20:40:31,725 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 215 transitions. Word has length 16 [2020-02-10 20:40:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,725 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 215 transitions. [2020-02-10 20:40:31,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 215 transitions. [2020-02-10 20:40:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:31,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,727 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1245457199, now seen corresponding path program 47 times [2020-02-10 20:40:31,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335957639] [2020-02-10 20:40:31,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335957639] [2020-02-10 20:40:31,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:31,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387730563] [2020-02-10 20:40:31,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:31,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:31,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:31,857 INFO L87 Difference]: Start difference. First operand 92 states and 215 transitions. Second operand 7 states. [2020-02-10 20:40:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,914 INFO L93 Difference]: Finished difference Result 144 states and 285 transitions. [2020-02-10 20:40:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:31,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,915 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:40:31,915 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:40:31,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:40:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2020-02-10 20:40:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:40:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 218 transitions. [2020-02-10 20:40:31,919 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 218 transitions. Word has length 16 [2020-02-10 20:40:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,920 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 218 transitions. [2020-02-10 20:40:31,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 218 transitions. [2020-02-10 20:40:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:31,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,921 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:31,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash 98712721, now seen corresponding path program 48 times [2020-02-10 20:40:31,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118473053] [2020-02-10 20:40:31,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118473053] [2020-02-10 20:40:32,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:32,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007256965] [2020-02-10 20:40:32,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:32,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:32,052 INFO L87 Difference]: Start difference. First operand 94 states and 218 transitions. Second operand 7 states. [2020-02-10 20:40:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,116 INFO L93 Difference]: Finished difference Result 135 states and 273 transitions. [2020-02-10 20:40:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:32,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,118 INFO L225 Difference]: With dead ends: 135 [2020-02-10 20:40:32,118 INFO L226 Difference]: Without dead ends: 118 [2020-02-10 20:40:32,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-02-10 20:40:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2020-02-10 20:40:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:40:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 202 transitions. [2020-02-10 20:40:32,122 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 202 transitions. Word has length 16 [2020-02-10 20:40:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:32,122 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 202 transitions. [2020-02-10 20:40:32,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 202 transitions. [2020-02-10 20:40:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:32,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,123 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:32,123 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -933023559, now seen corresponding path program 49 times [2020-02-10 20:40:32,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513231718] [2020-02-10 20:40:32,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513231718] [2020-02-10 20:40:32,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:32,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738697279] [2020-02-10 20:40:32,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:32,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:32,296 INFO L87 Difference]: Start difference. First operand 85 states and 202 transitions. Second operand 7 states. [2020-02-10 20:40:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,340 INFO L93 Difference]: Finished difference Result 135 states and 264 transitions. [2020-02-10 20:40:32,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:32,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,342 INFO L225 Difference]: With dead ends: 135 [2020-02-10 20:40:32,342 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 20:40:32,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 20:40:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2020-02-10 20:40:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:40:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-02-10 20:40:32,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 16 [2020-02-10 20:40:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:32,347 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-02-10 20:40:32,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-02-10 20:40:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:32,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:32,348 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1476458275, now seen corresponding path program 50 times [2020-02-10 20:40:32,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165356797] [2020-02-10 20:40:32,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165356797] [2020-02-10 20:40:32,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:32,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794041071] [2020-02-10 20:40:32,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:32,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:32,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:32,497 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 7 states. [2020-02-10 20:40:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,550 INFO L93 Difference]: Finished difference Result 140 states and 272 transitions. [2020-02-10 20:40:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:32,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,552 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:40:32,552 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:40:32,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:40:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2020-02-10 20:40:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:40:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 200 transitions. [2020-02-10 20:40:32,556 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 200 transitions. Word has length 16 [2020-02-10 20:40:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:32,556 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 200 transitions. [2020-02-10 20:40:32,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 200 transitions. [2020-02-10 20:40:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:32,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:32,558 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:32,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1301083935, now seen corresponding path program 51 times [2020-02-10 20:40:32,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845486179] [2020-02-10 20:40:32,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845486179] [2020-02-10 20:40:32,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:32,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144585736] [2020-02-10 20:40:32,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:32,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:32,737 INFO L87 Difference]: Start difference. First operand 85 states and 200 transitions. Second operand 7 states. [2020-02-10 20:40:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,787 INFO L93 Difference]: Finished difference Result 130 states and 253 transitions. [2020-02-10 20:40:32,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:32,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,789 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:40:32,789 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:40:32,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:40:32,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2020-02-10 20:40:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:40:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 201 transitions. [2020-02-10 20:40:32,794 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 201 transitions. Word has length 16 [2020-02-10 20:40:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:32,794 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 201 transitions. [2020-02-10 20:40:32,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 201 transitions. [2020-02-10 20:40:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:32,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:32,795 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2146901751, now seen corresponding path program 52 times [2020-02-10 20:40:32,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428184185] [2020-02-10 20:40:32,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428184185] [2020-02-10 20:40:32,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:32,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742158509] [2020-02-10 20:40:32,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:32,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:32,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:32,946 INFO L87 Difference]: Start difference. First operand 86 states and 201 transitions. Second operand 7 states. [2020-02-10 20:40:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,009 INFO L93 Difference]: Finished difference Result 131 states and 254 transitions. [2020-02-10 20:40:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:33,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,010 INFO L225 Difference]: With dead ends: 131 [2020-02-10 20:40:33,011 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:40:33,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:40:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 85. [2020-02-10 20:40:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:40:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 199 transitions. [2020-02-10 20:40:33,014 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 199 transitions. Word has length 16 [2020-02-10 20:40:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,015 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 199 transitions. [2020-02-10 20:40:33,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 199 transitions. [2020-02-10 20:40:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:33,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,016 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -989832141, now seen corresponding path program 53 times [2020-02-10 20:40:33,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822401163] [2020-02-10 20:40:33,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822401163] [2020-02-10 20:40:33,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861301082] [2020-02-10 20:40:33,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:33,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:33,176 INFO L87 Difference]: Start difference. First operand 85 states and 199 transitions. Second operand 7 states. [2020-02-10 20:40:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,214 INFO L93 Difference]: Finished difference Result 142 states and 275 transitions. [2020-02-10 20:40:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:33,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,216 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:40:33,216 INFO L226 Difference]: Without dead ends: 130 [2020-02-10 20:40:33,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-02-10 20:40:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2020-02-10 20:40:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:40:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 203 transitions. [2020-02-10 20:40:33,219 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 203 transitions. Word has length 16 [2020-02-10 20:40:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,219 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 203 transitions. [2020-02-10 20:40:33,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 203 transitions. [2020-02-10 20:40:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:33,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,220 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2129631519, now seen corresponding path program 54 times [2020-02-10 20:40:33,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329625575] [2020-02-10 20:40:33,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329625575] [2020-02-10 20:40:33,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:33,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918675295] [2020-02-10 20:40:33,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:33,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:33,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:33,408 INFO L87 Difference]: Start difference. First operand 88 states and 203 transitions. Second operand 7 states. [2020-02-10 20:40:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,478 INFO L93 Difference]: Finished difference Result 138 states and 265 transitions. [2020-02-10 20:40:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:33,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,480 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:40:33,481 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:40:33,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:40:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 83. [2020-02-10 20:40:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:40:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 194 transitions. [2020-02-10 20:40:33,485 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 194 transitions. Word has length 16 [2020-02-10 20:40:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,485 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 194 transitions. [2020-02-10 20:40:33,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 194 transitions. [2020-02-10 20:40:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:33,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,487 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash -397793757, now seen corresponding path program 55 times [2020-02-10 20:40:33,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834278305] [2020-02-10 20:40:33,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834278305] [2020-02-10 20:40:33,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:33,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427008113] [2020-02-10 20:40:33,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:33,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:33,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:33,674 INFO L87 Difference]: Start difference. First operand 83 states and 194 transitions. Second operand 7 states. [2020-02-10 20:40:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,721 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 20:40:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:33,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,723 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:40:33,723 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:40:33,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:40:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 83. [2020-02-10 20:40:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:40:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 193 transitions. [2020-02-10 20:40:33,727 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 193 transitions. Word has length 16 [2020-02-10 20:40:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,727 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 193 transitions. [2020-02-10 20:40:33,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 193 transitions. [2020-02-10 20:40:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:33,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,728 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash -941228473, now seen corresponding path program 56 times [2020-02-10 20:40:33,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691414680] [2020-02-10 20:40:33,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691414680] [2020-02-10 20:40:33,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:33,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074364369] [2020-02-10 20:40:33,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:33,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:33,858 INFO L87 Difference]: Start difference. First operand 83 states and 193 transitions. Second operand 7 states. [2020-02-10 20:40:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,896 INFO L93 Difference]: Finished difference Result 138 states and 265 transitions. [2020-02-10 20:40:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:33,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,897 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:40:33,897 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:40:33,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:40:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-02-10 20:40:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:40:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 188 transitions. [2020-02-10 20:40:33,900 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 188 transitions. Word has length 16 [2020-02-10 20:40:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,900 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 188 transitions. [2020-02-10 20:40:33,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 188 transitions. [2020-02-10 20:40:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:33,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,901 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1887198753, now seen corresponding path program 57 times [2020-02-10 20:40:33,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134585090] [2020-02-10 20:40:33,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134585090] [2020-02-10 20:40:34,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:34,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325173853] [2020-02-10 20:40:34,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:34,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:34,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:34,037 INFO L87 Difference]: Start difference. First operand 81 states and 188 transitions. Second operand 7 states. [2020-02-10 20:40:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,085 INFO L93 Difference]: Finished difference Result 128 states and 247 transitions. [2020-02-10 20:40:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:34,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,087 INFO L225 Difference]: With dead ends: 128 [2020-02-10 20:40:34,088 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:40:34,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:40:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2020-02-10 20:40:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:40:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. [2020-02-10 20:40:34,092 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 189 transitions. Word has length 16 [2020-02-10 20:40:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,092 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 189 transitions. [2020-02-10 20:40:34,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 189 transitions. [2020-02-10 20:40:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:34,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,093 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1552461889, now seen corresponding path program 58 times [2020-02-10 20:40:34,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239986302] [2020-02-10 20:40:34,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239986302] [2020-02-10 20:40:34,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:34,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52231784] [2020-02-10 20:40:34,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:34,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:34,225 INFO L87 Difference]: Start difference. First operand 82 states and 189 transitions. Second operand 7 states. [2020-02-10 20:40:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,279 INFO L93 Difference]: Finished difference Result 123 states and 244 transitions. [2020-02-10 20:40:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:34,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,281 INFO L225 Difference]: With dead ends: 123 [2020-02-10 20:40:34,281 INFO L226 Difference]: Without dead ends: 113 [2020-02-10 20:40:34,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-02-10 20:40:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2020-02-10 20:40:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:40:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 187 transitions. [2020-02-10 20:40:34,284 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 187 transitions. Word has length 16 [2020-02-10 20:40:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,284 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 187 transitions. [2020-02-10 20:40:34,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 187 transitions. [2020-02-10 20:40:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:34,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,285 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1685930971, now seen corresponding path program 59 times [2020-02-10 20:40:34,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382245577] [2020-02-10 20:40:34,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382245577] [2020-02-10 20:40:34,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:34,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184220596] [2020-02-10 20:40:34,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:34,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:34,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:34,445 INFO L87 Difference]: Start difference. First operand 81 states and 187 transitions. Second operand 7 states. [2020-02-10 20:40:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,495 INFO L93 Difference]: Finished difference Result 136 states and 263 transitions. [2020-02-10 20:40:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:34,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,497 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:40:34,497 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:40:34,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:40:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 85. [2020-02-10 20:40:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:40:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 193 transitions. [2020-02-10 20:40:34,500 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 193 transitions. Word has length 16 [2020-02-10 20:40:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,500 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 193 transitions. [2020-02-10 20:40:34,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 193 transitions. [2020-02-10 20:40:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:34,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,501 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash -760187613, now seen corresponding path program 60 times [2020-02-10 20:40:34,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449749623] [2020-02-10 20:40:34,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449749623] [2020-02-10 20:40:34,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:34,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226420803] [2020-02-10 20:40:34,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:34,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:34,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:34,644 INFO L87 Difference]: Start difference. First operand 85 states and 193 transitions. Second operand 7 states. [2020-02-10 20:40:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,727 INFO L93 Difference]: Finished difference Result 126 states and 248 transitions. [2020-02-10 20:40:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:34,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,729 INFO L225 Difference]: With dead ends: 126 [2020-02-10 20:40:34,729 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:40:34,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:40:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2020-02-10 20:40:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:40:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-02-10 20:40:34,732 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 16 [2020-02-10 20:40:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,732 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-02-10 20:40:34,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-02-10 20:40:34,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:34,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,733 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1920797981, now seen corresponding path program 61 times [2020-02-10 20:40:34,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979386460] [2020-02-10 20:40:34,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979386460] [2020-02-10 20:40:34,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:34,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833852109] [2020-02-10 20:40:34,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:34,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:34,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:34,896 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 7 states. [2020-02-10 20:40:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,936 INFO L93 Difference]: Finished difference Result 120 states and 230 transitions. [2020-02-10 20:40:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:34,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,938 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:40:34,938 INFO L226 Difference]: Without dead ends: 113 [2020-02-10 20:40:34,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-02-10 20:40:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2020-02-10 20:40:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:40:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 186 transitions. [2020-02-10 20:40:34,942 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 186 transitions. Word has length 16 [2020-02-10 20:40:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,942 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 186 transitions. [2020-02-10 20:40:34,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 186 transitions. [2020-02-10 20:40:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:34,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:34,943 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:34,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1073816371, now seen corresponding path program 62 times [2020-02-10 20:40:34,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55164122] [2020-02-10 20:40:34,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55164122] [2020-02-10 20:40:35,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:35,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354531824] [2020-02-10 20:40:35,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:35,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:35,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:35,086 INFO L87 Difference]: Start difference. First operand 81 states and 186 transitions. Second operand 7 states. [2020-02-10 20:40:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,148 INFO L93 Difference]: Finished difference Result 121 states and 231 transitions. [2020-02-10 20:40:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:35,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,149 INFO L225 Difference]: With dead ends: 121 [2020-02-10 20:40:35,149 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:40:35,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:40:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2020-02-10 20:40:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-02-10 20:40:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 184 transitions. [2020-02-10 20:40:35,152 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 184 transitions. Word has length 16 [2020-02-10 20:40:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,152 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 184 transitions. [2020-02-10 20:40:35,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 184 transitions. [2020-02-10 20:40:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:35,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,153 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1349343175, now seen corresponding path program 63 times [2020-02-10 20:40:35,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015742216] [2020-02-10 20:40:35,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015742216] [2020-02-10 20:40:35,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:35,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917183541] [2020-02-10 20:40:35,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:35,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:35,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:35,312 INFO L87 Difference]: Start difference. First operand 80 states and 184 transitions. Second operand 7 states. [2020-02-10 20:40:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,353 INFO L93 Difference]: Finished difference Result 119 states and 228 transitions. [2020-02-10 20:40:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:35,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,355 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:40:35,355 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:40:35,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:40:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2020-02-10 20:40:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:40:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 185 transitions. [2020-02-10 20:40:35,359 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 185 transitions. Word has length 16 [2020-02-10 20:40:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,359 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 185 transitions. [2020-02-10 20:40:35,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 185 transitions. [2020-02-10 20:40:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:35,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,360 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2090317467, now seen corresponding path program 64 times [2020-02-10 20:40:35,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972937189] [2020-02-10 20:40:35,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972937189] [2020-02-10 20:40:35,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:35,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964105034] [2020-02-10 20:40:35,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:35,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:35,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:35,512 INFO L87 Difference]: Start difference. First operand 81 states and 185 transitions. Second operand 7 states. [2020-02-10 20:40:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,592 INFO L93 Difference]: Finished difference Result 114 states and 225 transitions. [2020-02-10 20:40:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:35,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,594 INFO L225 Difference]: With dead ends: 114 [2020-02-10 20:40:35,595 INFO L226 Difference]: Without dead ends: 104 [2020-02-10 20:40:35,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-02-10 20:40:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 80. [2020-02-10 20:40:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-02-10 20:40:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 183 transitions. [2020-02-10 20:40:35,599 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 183 transitions. Word has length 16 [2020-02-10 20:40:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,599 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 183 transitions. [2020-02-10 20:40:35,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 183 transitions. [2020-02-10 20:40:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:35,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,601 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1818518869, now seen corresponding path program 65 times [2020-02-10 20:40:35,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492803009] [2020-02-10 20:40:35,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492803009] [2020-02-10 20:40:35,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060413301] [2020-02-10 20:40:35,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:35,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:35,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:35,806 INFO L87 Difference]: Start difference. First operand 80 states and 183 transitions. Second operand 7 states. [2020-02-10 20:40:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,880 INFO L93 Difference]: Finished difference Result 114 states and 226 transitions. [2020-02-10 20:40:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:35,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,881 INFO L225 Difference]: With dead ends: 114 [2020-02-10 20:40:35,882 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 20:40:35,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 20:40:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-02-10 20:40:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:40:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 186 transitions. [2020-02-10 20:40:35,885 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 186 transitions. Word has length 16 [2020-02-10 20:40:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,886 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 186 transitions. [2020-02-10 20:40:35,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 186 transitions. [2020-02-10 20:40:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:35,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:35,887 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash 3293241, now seen corresponding path program 66 times [2020-02-10 20:40:35,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891735512] [2020-02-10 20:40:35,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891735512] [2020-02-10 20:40:36,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:36,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934072679] [2020-02-10 20:40:36,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:36,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:36,092 INFO L87 Difference]: Start difference. First operand 82 states and 186 transitions. Second operand 7 states. [2020-02-10 20:40:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,167 INFO L93 Difference]: Finished difference Result 105 states and 215 transitions. [2020-02-10 20:40:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:36,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,169 INFO L225 Difference]: With dead ends: 105 [2020-02-10 20:40:36,169 INFO L226 Difference]: Without dead ends: 93 [2020-02-10 20:40:36,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-02-10 20:40:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2020-02-10 20:40:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:40:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 181 transitions. [2020-02-10 20:40:36,172 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 181 transitions. Word has length 16 [2020-02-10 20:40:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,172 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 181 transitions. [2020-02-10 20:40:36,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 181 transitions. [2020-02-10 20:40:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:36,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:36,173 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1694194197, now seen corresponding path program 67 times [2020-02-10 20:40:36,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988859842] [2020-02-10 20:40:36,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988859842] [2020-02-10 20:40:36,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:36,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527284447] [2020-02-10 20:40:36,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:36,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:36,352 INFO L87 Difference]: Start difference. First operand 79 states and 181 transitions. Second operand 7 states. [2020-02-10 20:40:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,391 INFO L93 Difference]: Finished difference Result 137 states and 267 transitions. [2020-02-10 20:40:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:36,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,392 INFO L225 Difference]: With dead ends: 137 [2020-02-10 20:40:36,393 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:40:36,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:40:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2020-02-10 20:40:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:40:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 195 transitions. [2020-02-10 20:40:36,396 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 195 transitions. Word has length 16 [2020-02-10 20:40:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,396 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 195 transitions. [2020-02-10 20:40:36,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 195 transitions. [2020-02-10 20:40:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:36,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:36,397 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:36,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,398 INFO L82 PathProgramCache]: Analyzing trace with hash 518690561, now seen corresponding path program 68 times [2020-02-10 20:40:36,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579026592] [2020-02-10 20:40:36,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579026592] [2020-02-10 20:40:36,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:36,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861823836] [2020-02-10 20:40:36,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:36,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:36,534 INFO L87 Difference]: Start difference. First operand 85 states and 195 transitions. Second operand 7 states. [2020-02-10 20:40:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,585 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 20:40:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:36,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,586 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:40:36,586 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:40:36,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:40:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2020-02-10 20:40:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:40:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 188 transitions. [2020-02-10 20:40:36,590 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 188 transitions. Word has length 16 [2020-02-10 20:40:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,591 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 188 transitions. [2020-02-10 20:40:36,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 188 transitions. [2020-02-10 20:40:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:36,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:36,592 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1959172537, now seen corresponding path program 69 times [2020-02-10 20:40:36,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133764567] [2020-02-10 20:40:36,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133764567] [2020-02-10 20:40:36,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:36,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922406837] [2020-02-10 20:40:36,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:36,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:36,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:36,741 INFO L87 Difference]: Start difference. First operand 82 states and 188 transitions. Second operand 7 states. [2020-02-10 20:40:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,801 INFO L93 Difference]: Finished difference Result 129 states and 249 transitions. [2020-02-10 20:40:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:36,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,802 INFO L225 Difference]: With dead ends: 129 [2020-02-10 20:40:36,802 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:40:36,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:40:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2020-02-10 20:40:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:40:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 194 transitions. [2020-02-10 20:40:36,806 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 194 transitions. Word has length 16 [2020-02-10 20:40:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,806 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 194 transitions. [2020-02-10 20:40:36,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 194 transitions. [2020-02-10 20:40:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:36,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:36,806 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1440320653, now seen corresponding path program 70 times [2020-02-10 20:40:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826594410] [2020-02-10 20:40:36,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826594410] [2020-02-10 20:40:36,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:36,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108350644] [2020-02-10 20:40:36,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:36,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:36,956 INFO L87 Difference]: Start difference. First operand 86 states and 194 transitions. Second operand 7 states. [2020-02-10 20:40:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,018 INFO L93 Difference]: Finished difference Result 119 states and 234 transitions. [2020-02-10 20:40:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:37,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,020 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:40:37,020 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 20:40:37,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 20:40:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-02-10 20:40:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:40:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 185 transitions. [2020-02-10 20:40:37,023 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 185 transitions. Word has length 16 [2020-02-10 20:40:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,024 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 185 transitions. [2020-02-10 20:40:37,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 185 transitions. [2020-02-10 20:40:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:37,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,025 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash -568756211, now seen corresponding path program 71 times [2020-02-10 20:40:37,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820925079] [2020-02-10 20:40:37,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820925079] [2020-02-10 20:40:37,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:37,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228537351] [2020-02-10 20:40:37,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:37,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:37,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:37,189 INFO L87 Difference]: Start difference. First operand 82 states and 185 transitions. Second operand 7 states. [2020-02-10 20:40:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,246 INFO L93 Difference]: Finished difference Result 116 states and 228 transitions. [2020-02-10 20:40:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:37,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,247 INFO L225 Difference]: With dead ends: 116 [2020-02-10 20:40:37,247 INFO L226 Difference]: Without dead ends: 108 [2020-02-10 20:40:37,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-02-10 20:40:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2020-02-10 20:40:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-02-10 20:40:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 188 transitions. [2020-02-10 20:40:37,249 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 188 transitions. Word has length 16 [2020-02-10 20:40:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,249 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 188 transitions. [2020-02-10 20:40:37,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 188 transitions. [2020-02-10 20:40:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:37,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,250 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,250 INFO L82 PathProgramCache]: Analyzing trace with hash -568161565, now seen corresponding path program 72 times [2020-02-10 20:40:37,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482123084] [2020-02-10 20:40:37,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482123084] [2020-02-10 20:40:37,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:37,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938952158] [2020-02-10 20:40:37,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:37,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:37,363 INFO L87 Difference]: Start difference. First operand 84 states and 188 transitions. Second operand 7 states. [2020-02-10 20:40:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,408 INFO L93 Difference]: Finished difference Result 107 states and 217 transitions. [2020-02-10 20:40:37,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:37,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,410 INFO L225 Difference]: With dead ends: 107 [2020-02-10 20:40:37,410 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:40:37,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:40:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2020-02-10 20:40:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:40:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 176 transitions. [2020-02-10 20:40:37,413 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 176 transitions. Word has length 16 [2020-02-10 20:40:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,413 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 176 transitions. [2020-02-10 20:40:37,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 176 transitions. [2020-02-10 20:40:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:37,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,414 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,414 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash 577387645, now seen corresponding path program 73 times [2020-02-10 20:40:37,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682113609] [2020-02-10 20:40:37,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682113609] [2020-02-10 20:40:37,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:37,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928681972] [2020-02-10 20:40:37,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:37,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:37,563 INFO L87 Difference]: Start difference. First operand 77 states and 176 transitions. Second operand 7 states. [2020-02-10 20:40:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,608 INFO L93 Difference]: Finished difference Result 119 states and 225 transitions. [2020-02-10 20:40:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:37,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,610 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:40:37,610 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:40:37,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:40:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2020-02-10 20:40:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:40:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-02-10 20:40:37,614 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 16 [2020-02-10 20:40:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,614 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-02-10 20:40:37,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-02-10 20:40:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:37,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,615 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash -775107319, now seen corresponding path program 74 times [2020-02-10 20:40:37,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431531581] [2020-02-10 20:40:37,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431531581] [2020-02-10 20:40:37,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:37,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386251654] [2020-02-10 20:40:37,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:37,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:37,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:37,759 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 7 states. [2020-02-10 20:40:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,820 INFO L93 Difference]: Finished difference Result 122 states and 230 transitions. [2020-02-10 20:40:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:37,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,822 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:40:37,822 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:40:37,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:40:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2020-02-10 20:40:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:40:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 175 transitions. [2020-02-10 20:40:37,825 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 175 transitions. Word has length 16 [2020-02-10 20:40:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,826 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 175 transitions. [2020-02-10 20:40:37,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 175 transitions. [2020-02-10 20:40:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:37,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,827 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1322090143, now seen corresponding path program 75 times [2020-02-10 20:40:37,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279678076] [2020-02-10 20:40:37,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279678076] [2020-02-10 20:40:37,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:37,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929435234] [2020-02-10 20:40:37,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:37,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:37,980 INFO L87 Difference]: Start difference. First operand 77 states and 175 transitions. Second operand 7 states. [2020-02-10 20:40:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,034 INFO L93 Difference]: Finished difference Result 117 states and 220 transitions. [2020-02-10 20:40:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:38,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,035 INFO L225 Difference]: With dead ends: 117 [2020-02-10 20:40:38,035 INFO L226 Difference]: Without dead ends: 110 [2020-02-10 20:40:38,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-02-10 20:40:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2020-02-10 20:40:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:40:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 176 transitions. [2020-02-10 20:40:38,038 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 176 transitions. Word has length 16 [2020-02-10 20:40:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,038 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 176 transitions. [2020-02-10 20:40:38,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 176 transitions. [2020-02-10 20:40:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:38,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,039 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2125895543, now seen corresponding path program 76 times [2020-02-10 20:40:38,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119713591] [2020-02-10 20:40:38,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119713591] [2020-02-10 20:40:38,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:38,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548278708] [2020-02-10 20:40:38,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:38,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:38,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:38,175 INFO L87 Difference]: Start difference. First operand 78 states and 176 transitions. Second operand 7 states. [2020-02-10 20:40:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,243 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2020-02-10 20:40:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:38,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,244 INFO L225 Difference]: With dead ends: 118 [2020-02-10 20:40:38,244 INFO L226 Difference]: Without dead ends: 109 [2020-02-10 20:40:38,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-02-10 20:40:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 77. [2020-02-10 20:40:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:40:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 174 transitions. [2020-02-10 20:40:38,247 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 174 transitions. Word has length 16 [2020-02-10 20:40:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,248 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 174 transitions. [2020-02-10 20:40:38,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 174 transitions. [2020-02-10 20:40:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:38,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,249 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash -288481185, now seen corresponding path program 77 times [2020-02-10 20:40:38,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540544213] [2020-02-10 20:40:38,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540544213] [2020-02-10 20:40:38,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:38,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503117812] [2020-02-10 20:40:38,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:38,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:38,381 INFO L87 Difference]: Start difference. First operand 77 states and 174 transitions. Second operand 7 states. [2020-02-10 20:40:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,442 INFO L93 Difference]: Finished difference Result 124 states and 234 transitions. [2020-02-10 20:40:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:38,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,444 INFO L225 Difference]: With dead ends: 124 [2020-02-10 20:40:38,445 INFO L226 Difference]: Without dead ends: 114 [2020-02-10 20:40:38,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-02-10 20:40:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 79. [2020-02-10 20:40:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:40:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 177 transitions. [2020-02-10 20:40:38,448 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 177 transitions. Word has length 16 [2020-02-10 20:40:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,448 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 177 transitions. [2020-02-10 20:40:38,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 177 transitions. [2020-02-10 20:40:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:38,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,449 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1055688735, now seen corresponding path program 78 times [2020-02-10 20:40:38,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944530530] [2020-02-10 20:40:38,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944530530] [2020-02-10 20:40:38,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:38,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530795492] [2020-02-10 20:40:38,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:38,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:38,590 INFO L87 Difference]: Start difference. First operand 79 states and 177 transitions. Second operand 7 states. [2020-02-10 20:40:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,652 INFO L93 Difference]: Finished difference Result 122 states and 228 transitions. [2020-02-10 20:40:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:38,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,654 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:40:38,654 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:40:38,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:40:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2020-02-10 20:40:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 20:40:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 172 transitions. [2020-02-10 20:40:38,657 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 172 transitions. Word has length 16 [2020-02-10 20:40:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,657 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 172 transitions. [2020-02-10 20:40:38,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 172 transitions. [2020-02-10 20:40:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:38,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,658 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1112617447, now seen corresponding path program 79 times [2020-02-10 20:40:38,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223422734] [2020-02-10 20:40:38,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223422734] [2020-02-10 20:40:38,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:38,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557691748] [2020-02-10 20:40:38,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:38,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:38,834 INFO L87 Difference]: Start difference. First operand 76 states and 172 transitions. Second operand 7 states. [2020-02-10 20:40:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,887 INFO L93 Difference]: Finished difference Result 119 states and 224 transitions. [2020-02-10 20:40:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:38,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,889 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:40:38,889 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:40:38,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:40:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2020-02-10 20:40:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 20:40:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 171 transitions. [2020-02-10 20:40:38,893 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 171 transitions. Word has length 16 [2020-02-10 20:40:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,893 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 171 transitions. [2020-02-10 20:40:38,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 171 transitions. [2020-02-10 20:40:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:38,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,895 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -239877517, now seen corresponding path program 80 times [2020-02-10 20:40:38,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360267339] [2020-02-10 20:40:38,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360267339] [2020-02-10 20:40:39,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:39,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122420410] [2020-02-10 20:40:39,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:39,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:39,032 INFO L87 Difference]: Start difference. First operand 76 states and 171 transitions. Second operand 7 states. [2020-02-10 20:40:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,081 INFO L93 Difference]: Finished difference Result 122 states and 229 transitions. [2020-02-10 20:40:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:39,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,082 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:40:39,082 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:40:39,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:40:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2020-02-10 20:40:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:40:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 169 transitions. [2020-02-10 20:40:39,085 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 169 transitions. Word has length 16 [2020-02-10 20:40:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,085 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 169 transitions. [2020-02-10 20:40:39,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 169 transitions. [2020-02-10 20:40:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:39,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,087 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1866192545, now seen corresponding path program 81 times [2020-02-10 20:40:39,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271654165] [2020-02-10 20:40:39,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271654165] [2020-02-10 20:40:39,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:39,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421938389] [2020-02-10 20:40:39,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:39,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:39,210 INFO L87 Difference]: Start difference. First operand 75 states and 169 transitions. Second operand 7 states. [2020-02-10 20:40:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,256 INFO L93 Difference]: Finished difference Result 117 states and 220 transitions. [2020-02-10 20:40:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:39,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,257 INFO L225 Difference]: With dead ends: 117 [2020-02-10 20:40:39,257 INFO L226 Difference]: Without dead ends: 110 [2020-02-10 20:40:39,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-02-10 20:40:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2020-02-10 20:40:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 20:40:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 170 transitions. [2020-02-10 20:40:39,260 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 170 transitions. Word has length 16 [2020-02-10 20:40:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,260 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 170 transitions. [2020-02-10 20:40:39,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 170 transitions. [2020-02-10 20:40:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:39,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,261 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1573468097, now seen corresponding path program 82 times [2020-02-10 20:40:39,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610723509] [2020-02-10 20:40:39,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610723509] [2020-02-10 20:40:39,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:39,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889872567] [2020-02-10 20:40:39,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:39,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:39,404 INFO L87 Difference]: Start difference. First operand 76 states and 170 transitions. Second operand 7 states. [2020-02-10 20:40:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,462 INFO L93 Difference]: Finished difference Result 112 states and 217 transitions. [2020-02-10 20:40:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:39,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,464 INFO L225 Difference]: With dead ends: 112 [2020-02-10 20:40:39,464 INFO L226 Difference]: Without dead ends: 102 [2020-02-10 20:40:39,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-02-10 20:40:39,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2020-02-10 20:40:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:40:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-02-10 20:40:39,467 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 16 [2020-02-10 20:40:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,467 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-02-10 20:40:39,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-02-10 20:40:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:39,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,468 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash -984580015, now seen corresponding path program 83 times [2020-02-10 20:40:39,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417248893] [2020-02-10 20:40:39,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417248893] [2020-02-10 20:40:39,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:39,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782721324] [2020-02-10 20:40:39,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:39,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:39,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:39,612 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 7 states. [2020-02-10 20:40:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,677 INFO L93 Difference]: Finished difference Result 122 states and 231 transitions. [2020-02-10 20:40:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:39,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,679 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:40:39,679 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:40:39,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:40:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2020-02-10 20:40:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:40:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 173 transitions. [2020-02-10 20:40:39,682 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 173 transitions. Word has length 16 [2020-02-10 20:40:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,683 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 173 transitions. [2020-02-10 20:40:39,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 173 transitions. [2020-02-10 20:40:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:39,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,684 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -116381337, now seen corresponding path program 84 times [2020-02-10 20:40:39,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936788819] [2020-02-10 20:40:39,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936788819] [2020-02-10 20:40:39,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:39,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698472687] [2020-02-10 20:40:39,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:39,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:39,852 INFO L87 Difference]: Start difference. First operand 78 states and 173 transitions. Second operand 7 states. [2020-02-10 20:40:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,916 INFO L93 Difference]: Finished difference Result 114 states and 220 transitions. [2020-02-10 20:40:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:39,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,917 INFO L225 Difference]: With dead ends: 114 [2020-02-10 20:40:39,917 INFO L226 Difference]: Without dead ends: 101 [2020-02-10 20:40:39,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-02-10 20:40:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2020-02-10 20:40:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:40:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 166 transitions. [2020-02-10 20:40:39,920 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 166 transitions. Word has length 16 [2020-02-10 20:40:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,920 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 166 transitions. [2020-02-10 20:40:39,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 166 transitions. [2020-02-10 20:40:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:39,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:39,921 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash -826706393, now seen corresponding path program 85 times [2020-02-10 20:40:39,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551566638] [2020-02-10 20:40:39,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551566638] [2020-02-10 20:40:40,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:40,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711173430] [2020-02-10 20:40:40,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:40,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:40,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:40,103 INFO L87 Difference]: Start difference. First operand 74 states and 166 transitions. Second operand 7 states. [2020-02-10 20:40:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,143 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2020-02-10 20:40:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:40,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,145 INFO L225 Difference]: With dead ends: 111 [2020-02-10 20:40:40,145 INFO L226 Difference]: Without dead ends: 104 [2020-02-10 20:40:40,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-02-10 20:40:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2020-02-10 20:40:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:40:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 165 transitions. [2020-02-10 20:40:40,148 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 165 transitions. Word has length 16 [2020-02-10 20:40:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,148 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 165 transitions. [2020-02-10 20:40:40,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 165 transitions. [2020-02-10 20:40:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:40,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,149 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash 20275217, now seen corresponding path program 86 times [2020-02-10 20:40:40,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354169374] [2020-02-10 20:40:40,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354169374] [2020-02-10 20:40:40,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:40,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720489024] [2020-02-10 20:40:40,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:40,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:40,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:40,309 INFO L87 Difference]: Start difference. First operand 74 states and 165 transitions. Second operand 7 states. [2020-02-10 20:40:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,360 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2020-02-10 20:40:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:40,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,361 INFO L225 Difference]: With dead ends: 112 [2020-02-10 20:40:40,361 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 20:40:40,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 20:40:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2020-02-10 20:40:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:40:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 163 transitions. [2020-02-10 20:40:40,363 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 163 transitions. Word has length 16 [2020-02-10 20:40:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,363 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 163 transitions. [2020-02-10 20:40:40,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 163 transitions. [2020-02-10 20:40:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:40,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,364 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash -255251587, now seen corresponding path program 87 times [2020-02-10 20:40:40,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486108784] [2020-02-10 20:40:40,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486108784] [2020-02-10 20:40:40,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:40,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027289868] [2020-02-10 20:40:40,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:40,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:40,523 INFO L87 Difference]: Start difference. First operand 73 states and 163 transitions. Second operand 7 states. [2020-02-10 20:40:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,564 INFO L93 Difference]: Finished difference Result 110 states and 204 transitions. [2020-02-10 20:40:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:40,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,565 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:40:40,565 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 20:40:40,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 20:40:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2020-02-10 20:40:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:40:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 161 transitions. [2020-02-10 20:40:40,568 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 161 transitions. Word has length 16 [2020-02-10 20:40:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,568 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 161 transitions. [2020-02-10 20:40:40,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 161 transitions. [2020-02-10 20:40:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:40,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,568 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1110558241, now seen corresponding path program 88 times [2020-02-10 20:40:40,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364342436] [2020-02-10 20:40:40,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364342436] [2020-02-10 20:40:40,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:40,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107235622] [2020-02-10 20:40:40,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:40,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:40,711 INFO L87 Difference]: Start difference. First operand 72 states and 161 transitions. Second operand 7 states. [2020-02-10 20:40:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,789 INFO L93 Difference]: Finished difference Result 105 states and 201 transitions. [2020-02-10 20:40:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:40,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,790 INFO L225 Difference]: With dead ends: 105 [2020-02-10 20:40:40,790 INFO L226 Difference]: Without dead ends: 95 [2020-02-10 20:40:40,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-02-10 20:40:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2020-02-10 20:40:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:40:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 159 transitions. [2020-02-10 20:40:40,793 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 159 transitions. Word has length 16 [2020-02-10 20:40:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,793 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 159 transitions. [2020-02-10 20:40:40,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 159 transitions. [2020-02-10 20:40:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:40,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,795 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash -724427281, now seen corresponding path program 89 times [2020-02-10 20:40:40,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761433135] [2020-02-10 20:40:40,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761433135] [2020-02-10 20:40:40,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:40,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132339928] [2020-02-10 20:40:40,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:40,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:40,949 INFO L87 Difference]: Start difference. First operand 71 states and 159 transitions. Second operand 7 states. [2020-02-10 20:40:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,014 INFO L93 Difference]: Finished difference Result 105 states and 202 transitions. [2020-02-10 20:40:41,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:41,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,016 INFO L225 Difference]: With dead ends: 105 [2020-02-10 20:40:41,016 INFO L226 Difference]: Without dead ends: 97 [2020-02-10 20:40:41,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-02-10 20:40:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2020-02-10 20:40:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:40:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 162 transitions. [2020-02-10 20:40:41,019 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 162 transitions. Word has length 16 [2020-02-10 20:40:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,019 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 162 transitions. [2020-02-10 20:40:41,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 162 transitions. [2020-02-10 20:40:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:41,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,020 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1097384829, now seen corresponding path program 90 times [2020-02-10 20:40:41,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625229124] [2020-02-10 20:40:41,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625229124] [2020-02-10 20:40:41,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661314188] [2020-02-10 20:40:41,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:41,188 INFO L87 Difference]: Start difference. First operand 73 states and 162 transitions. Second operand 7 states. [2020-02-10 20:40:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,257 INFO L93 Difference]: Finished difference Result 96 states and 191 transitions. [2020-02-10 20:40:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:41,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,258 INFO L225 Difference]: With dead ends: 96 [2020-02-10 20:40:41,258 INFO L226 Difference]: Without dead ends: 84 [2020-02-10 20:40:41,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-02-10 20:40:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2020-02-10 20:40:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-02-10 20:40:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 157 transitions. [2020-02-10 20:40:41,261 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 157 transitions. Word has length 16 [2020-02-10 20:40:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,261 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 157 transitions. [2020-02-10 20:40:41,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 157 transitions. [2020-02-10 20:40:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:41,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,262 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1899422143, now seen corresponding path program 91 times [2020-02-10 20:40:41,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712902157] [2020-02-10 20:40:41,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712902157] [2020-02-10 20:40:41,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:41,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725411931] [2020-02-10 20:40:41,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:41,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:41,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:41,435 INFO L87 Difference]: Start difference. First operand 70 states and 157 transitions. Second operand 7 states. [2020-02-10 20:40:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,496 INFO L93 Difference]: Finished difference Result 112 states and 221 transitions. [2020-02-10 20:40:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:41,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,497 INFO L225 Difference]: With dead ends: 112 [2020-02-10 20:40:41,497 INFO L226 Difference]: Without dead ends: 102 [2020-02-10 20:40:41,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-02-10 20:40:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2020-02-10 20:40:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:40:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 167 transitions. [2020-02-10 20:40:41,500 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 167 transitions. Word has length 16 [2020-02-10 20:40:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,500 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 167 transitions. [2020-02-10 20:40:41,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2020-02-10 20:40:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:41,501 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,501 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,502 INFO L82 PathProgramCache]: Analyzing trace with hash -555252223, now seen corresponding path program 92 times [2020-02-10 20:40:41,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13443442] [2020-02-10 20:40:41,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13443442] [2020-02-10 20:40:41,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:41,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335763790] [2020-02-10 20:40:41,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:41,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:41,623 INFO L87 Difference]: Start difference. First operand 74 states and 167 transitions. Second operand 7 states. [2020-02-10 20:40:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,676 INFO L93 Difference]: Finished difference Result 110 states and 215 transitions. [2020-02-10 20:40:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:41,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,677 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:40:41,678 INFO L226 Difference]: Without dead ends: 100 [2020-02-10 20:40:41,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-02-10 20:40:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2020-02-10 20:40:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:40:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 162 transitions. [2020-02-10 20:40:41,680 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 162 transitions. Word has length 16 [2020-02-10 20:40:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,680 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 162 transitions. [2020-02-10 20:40:41,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 162 transitions. [2020-02-10 20:40:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:41,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,681 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1257821581, now seen corresponding path program 93 times [2020-02-10 20:40:41,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977013712] [2020-02-10 20:40:41,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977013712] [2020-02-10 20:40:41,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:41,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525774083] [2020-02-10 20:40:41,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:41,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:41,817 INFO L87 Difference]: Start difference. First operand 72 states and 162 transitions. Second operand 7 states. [2020-02-10 20:40:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,870 INFO L93 Difference]: Finished difference Result 106 states and 207 transitions. [2020-02-10 20:40:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:41,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,872 INFO L225 Difference]: With dead ends: 106 [2020-02-10 20:40:41,872 INFO L226 Difference]: Without dead ends: 96 [2020-02-10 20:40:41,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-02-10 20:40:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2020-02-10 20:40:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:40:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 167 transitions. [2020-02-10 20:40:41,874 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 167 transitions. Word has length 16 [2020-02-10 20:40:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,875 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 167 transitions. [2020-02-10 20:40:41,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 167 transitions. [2020-02-10 20:40:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:41,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:41,876 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2084126929, now seen corresponding path program 94 times [2020-02-10 20:40:41,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497683497] [2020-02-10 20:40:41,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497683497] [2020-02-10 20:40:42,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:42,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307953357] [2020-02-10 20:40:42,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:42,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:42,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:42,024 INFO L87 Difference]: Start difference. First operand 75 states and 167 transitions. Second operand 7 states. [2020-02-10 20:40:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,083 INFO L93 Difference]: Finished difference Result 98 states and 196 transitions. [2020-02-10 20:40:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:42,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,085 INFO L225 Difference]: With dead ends: 98 [2020-02-10 20:40:42,085 INFO L226 Difference]: Without dead ends: 86 [2020-02-10 20:40:42,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-02-10 20:40:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2020-02-10 20:40:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:40:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 160 transitions. [2020-02-10 20:40:42,087 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 160 transitions. Word has length 16 [2020-02-10 20:40:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,087 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 160 transitions. [2020-02-10 20:40:42,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 160 transitions. [2020-02-10 20:40:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:42,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:42,088 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 941654993, now seen corresponding path program 95 times [2020-02-10 20:40:42,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260739331] [2020-02-10 20:40:42,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260739331] [2020-02-10 20:40:42,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:42,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502337329] [2020-02-10 20:40:42,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:42,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:42,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:42,236 INFO L87 Difference]: Start difference. First operand 72 states and 160 transitions. Second operand 7 states. [2020-02-10 20:40:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,288 INFO L93 Difference]: Finished difference Result 92 states and 184 transitions. [2020-02-10 20:40:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:42,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,289 INFO L225 Difference]: With dead ends: 92 [2020-02-10 20:40:42,289 INFO L226 Difference]: Without dead ends: 84 [2020-02-10 20:40:42,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-02-10 20:40:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-02-10 20:40:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:40:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 163 transitions. [2020-02-10 20:40:42,292 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 163 transitions. Word has length 16 [2020-02-10 20:40:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,292 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 163 transitions. [2020-02-10 20:40:42,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 163 transitions. [2020-02-10 20:40:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:42,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:42,293 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash 942249639, now seen corresponding path program 96 times [2020-02-10 20:40:42,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152902021] [2020-02-10 20:40:42,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152902021] [2020-02-10 20:40:42,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:42,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787114855] [2020-02-10 20:40:42,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:42,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:42,442 INFO L87 Difference]: Start difference. First operand 74 states and 163 transitions. Second operand 7 states. [2020-02-10 20:40:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,492 INFO L93 Difference]: Finished difference Result 83 states and 173 transitions. [2020-02-10 20:40:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:42,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,493 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:40:42,493 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:40:42,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:40:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-02-10 20:40:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 20:40:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 155 transitions. [2020-02-10 20:40:42,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 155 transitions. Word has length 16 [2020-02-10 20:40:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,496 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 155 transitions. [2020-02-10 20:40:42,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 155 transitions. [2020-02-10 20:40:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:42,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:42,496 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash -370908157, now seen corresponding path program 97 times [2020-02-10 20:40:42,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28049507] [2020-02-10 20:40:42,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28049507] [2020-02-10 20:40:42,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:42,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516532205] [2020-02-10 20:40:42,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:42,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:42,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:42,638 INFO L87 Difference]: Start difference. First operand 69 states and 155 transitions. Second operand 7 states. [2020-02-10 20:40:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,678 INFO L93 Difference]: Finished difference Result 111 states and 213 transitions. [2020-02-10 20:40:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:42,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,680 INFO L225 Difference]: With dead ends: 111 [2020-02-10 20:40:42,680 INFO L226 Difference]: Without dead ends: 99 [2020-02-10 20:40:42,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-02-10 20:40:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2020-02-10 20:40:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:40:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 164 transitions. [2020-02-10 20:40:42,683 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 164 transitions. Word has length 16 [2020-02-10 20:40:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,683 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 164 transitions. [2020-02-10 20:40:42,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 164 transitions. [2020-02-10 20:40:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:42,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:42,683 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash -368774737, now seen corresponding path program 98 times [2020-02-10 20:40:42,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941965112] [2020-02-10 20:40:42,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941965112] [2020-02-10 20:40:42,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:42,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505854139] [2020-02-10 20:40:42,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:42,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:42,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:42,938 INFO L87 Difference]: Start difference. First operand 75 states and 164 transitions. Second operand 7 states. [2020-02-10 20:40:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,996 INFO L93 Difference]: Finished difference Result 109 states and 205 transitions. [2020-02-10 20:40:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:42,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,997 INFO L225 Difference]: With dead ends: 109 [2020-02-10 20:40:42,997 INFO L226 Difference]: Without dead ends: 93 [2020-02-10 20:40:42,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-02-10 20:40:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2020-02-10 20:40:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 20:40:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 151 transitions. [2020-02-10 20:40:43,000 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 151 transitions. Word has length 16 [2020-02-10 20:40:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,001 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 151 transitions. [2020-02-10 20:40:43,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 151 transitions. [2020-02-10 20:40:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:43,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,001 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1651313597, now seen corresponding path program 99 times [2020-02-10 20:40:43,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332244669] [2020-02-10 20:40:43,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332244669] [2020-02-10 20:40:43,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:43,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185805755] [2020-02-10 20:40:43,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:43,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:43,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:43,159 INFO L87 Difference]: Start difference. First operand 69 states and 151 transitions. Second operand 7 states. [2020-02-10 20:40:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,196 INFO L93 Difference]: Finished difference Result 106 states and 198 transitions. [2020-02-10 20:40:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:43,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,197 INFO L225 Difference]: With dead ends: 106 [2020-02-10 20:40:43,197 INFO L226 Difference]: Without dead ends: 94 [2020-02-10 20:40:43,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-02-10 20:40:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2020-02-10 20:40:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:40:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 155 transitions. [2020-02-10 20:40:43,201 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 155 transitions. Word has length 16 [2020-02-10 20:40:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,201 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 155 transitions. [2020-02-10 20:40:43,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 155 transitions. [2020-02-10 20:40:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:43,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,202 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1468150063, now seen corresponding path program 100 times [2020-02-10 20:40:43,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469382602] [2020-02-10 20:40:43,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469382602] [2020-02-10 20:40:43,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:43,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412209979] [2020-02-10 20:40:43,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:43,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:43,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:43,341 INFO L87 Difference]: Start difference. First operand 72 states and 155 transitions. Second operand 7 states. [2020-02-10 20:40:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,419 INFO L93 Difference]: Finished difference Result 102 states and 188 transitions. [2020-02-10 20:40:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:43,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,420 INFO L225 Difference]: With dead ends: 102 [2020-02-10 20:40:43,420 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:40:43,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:40:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2020-02-10 20:40:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 20:40:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 148 transitions. [2020-02-10 20:40:43,423 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 148 transitions. Word has length 16 [2020-02-10 20:40:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,423 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 148 transitions. [2020-02-10 20:40:43,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 148 transitions. [2020-02-10 20:40:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:43,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,428 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1834593451, now seen corresponding path program 101 times [2020-02-10 20:40:43,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325820323] [2020-02-10 20:40:43,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325820323] [2020-02-10 20:40:43,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:43,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714850801] [2020-02-10 20:40:43,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:43,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:43,586 INFO L87 Difference]: Start difference. First operand 69 states and 148 transitions. Second operand 7 states. [2020-02-10 20:40:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,646 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2020-02-10 20:40:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:43,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,647 INFO L225 Difference]: With dead ends: 101 [2020-02-10 20:40:43,648 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:40:43,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:40:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2020-02-10 20:40:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:40:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 151 transitions. [2020-02-10 20:40:43,650 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 151 transitions. Word has length 16 [2020-02-10 20:40:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,651 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 151 transitions. [2020-02-10 20:40:43,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 151 transitions. [2020-02-10 20:40:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:43,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,652 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1116203925, now seen corresponding path program 102 times [2020-02-10 20:40:43,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152047494] [2020-02-10 20:40:43,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152047494] [2020-02-10 20:40:43,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:43,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120677329] [2020-02-10 20:40:43,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:43,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:43,773 INFO L87 Difference]: Start difference. First operand 71 states and 151 transitions. Second operand 7 states. [2020-02-10 20:40:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,823 INFO L93 Difference]: Finished difference Result 99 states and 181 transitions. [2020-02-10 20:40:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:43,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,824 INFO L225 Difference]: With dead ends: 99 [2020-02-10 20:40:43,824 INFO L226 Difference]: Without dead ends: 85 [2020-02-10 20:40:43,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-02-10 20:40:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2020-02-10 20:40:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-02-10 20:40:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 139 transitions. [2020-02-10 20:40:43,825 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 139 transitions. Word has length 16 [2020-02-10 20:40:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,826 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 139 transitions. [2020-02-10 20:40:43,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 139 transitions. [2020-02-10 20:40:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:43,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,826 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:43,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1956127215, now seen corresponding path program 103 times [2020-02-10 20:40:43,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769937861] [2020-02-10 20:40:43,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769937861] [2020-02-10 20:40:43,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:43,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702615363] [2020-02-10 20:40:43,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:43,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:43,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:43,977 INFO L87 Difference]: Start difference. First operand 65 states and 139 transitions. Second operand 7 states. [2020-02-10 20:40:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,014 INFO L93 Difference]: Finished difference Result 101 states and 183 transitions. [2020-02-10 20:40:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:44,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,015 INFO L225 Difference]: With dead ends: 101 [2020-02-10 20:40:44,016 INFO L226 Difference]: Without dead ends: 89 [2020-02-10 20:40:44,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-02-10 20:40:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2020-02-10 20:40:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-02-10 20:40:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 134 transitions. [2020-02-10 20:40:44,019 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 134 transitions. Word has length 16 [2020-02-10 20:40:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,019 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 134 transitions. [2020-02-10 20:40:44,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 134 transitions. [2020-02-10 20:40:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:44,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,020 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1953993795, now seen corresponding path program 104 times [2020-02-10 20:40:44,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978612994] [2020-02-10 20:40:44,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978612994] [2020-02-10 20:40:44,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:44,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918553507] [2020-02-10 20:40:44,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:44,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:44,169 INFO L87 Difference]: Start difference. First operand 65 states and 134 transitions. Second operand 7 states. [2020-02-10 20:40:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,221 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2020-02-10 20:40:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:44,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,222 INFO L225 Difference]: With dead ends: 99 [2020-02-10 20:40:44,222 INFO L226 Difference]: Without dead ends: 83 [2020-02-10 20:40:44,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-02-10 20:40:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2020-02-10 20:40:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-02-10 20:40:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 120 transitions. [2020-02-10 20:40:44,225 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 120 transitions. Word has length 16 [2020-02-10 20:40:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,225 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 120 transitions. [2020-02-10 20:40:44,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 120 transitions. [2020-02-10 20:40:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:44,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,226 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1434938509, now seen corresponding path program 105 times [2020-02-10 20:40:44,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428182620] [2020-02-10 20:40:44,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428182620] [2020-02-10 20:40:44,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:44,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162244271] [2020-02-10 20:40:44,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:44,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:44,401 INFO L87 Difference]: Start difference. First operand 59 states and 120 transitions. Second operand 7 states. [2020-02-10 20:40:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,439 INFO L93 Difference]: Finished difference Result 92 states and 162 transitions. [2020-02-10 20:40:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:44,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,441 INFO L225 Difference]: With dead ends: 92 [2020-02-10 20:40:44,441 INFO L226 Difference]: Without dead ends: 80 [2020-02-10 20:40:44,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-02-10 20:40:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2020-02-10 20:40:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-02-10 20:40:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 126 transitions. [2020-02-10 20:40:44,443 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 126 transitions. Word has length 16 [2020-02-10 20:40:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,444 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 126 transitions. [2020-02-10 20:40:44,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 126 transitions. [2020-02-10 20:40:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:44,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,444 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1473916669, now seen corresponding path program 106 times [2020-02-10 20:40:44,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287841398] [2020-02-10 20:40:44,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287841398] [2020-02-10 20:40:44,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:44,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232215113] [2020-02-10 20:40:44,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:44,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:44,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:44,605 INFO L87 Difference]: Start difference. First operand 63 states and 126 transitions. Second operand 7 states. [2020-02-10 20:40:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,657 INFO L93 Difference]: Finished difference Result 82 states and 147 transitions. [2020-02-10 20:40:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:44,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,658 INFO L225 Difference]: With dead ends: 82 [2020-02-10 20:40:44,658 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:40:44,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:40:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2020-02-10 20:40:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-02-10 20:40:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 116 transitions. [2020-02-10 20:40:44,660 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 116 transitions. Word has length 16 [2020-02-10 20:40:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,660 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 116 transitions. [2020-02-10 20:40:44,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 116 transitions. [2020-02-10 20:40:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:44,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,661 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,661 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash 340355231, now seen corresponding path program 107 times [2020-02-10 20:40:44,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029144907] [2020-02-10 20:40:44,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029144907] [2020-02-10 20:40:44,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:44,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680233175] [2020-02-10 20:40:44,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:44,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:44,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:44,802 INFO L87 Difference]: Start difference. First operand 59 states and 116 transitions. Second operand 7 states. [2020-02-10 20:40:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,854 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2020-02-10 20:40:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:44,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,856 INFO L225 Difference]: With dead ends: 89 [2020-02-10 20:40:44,856 INFO L226 Difference]: Without dead ends: 79 [2020-02-10 20:40:44,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-02-10 20:40:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2020-02-10 20:40:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-02-10 20:40:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 121 transitions. [2020-02-10 20:40:44,858 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 121 transitions. Word has length 16 [2020-02-10 20:40:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,858 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 121 transitions. [2020-02-10 20:40:44,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 121 transitions. [2020-02-10 20:40:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:44,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,859 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 243832391, now seen corresponding path program 108 times [2020-02-10 20:40:44,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409832874] [2020-02-10 20:40:44,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409832874] [2020-02-10 20:40:45,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:45,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430690348] [2020-02-10 20:40:45,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:45,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:45,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:45,013 INFO L87 Difference]: Start difference. First operand 62 states and 121 transitions. Second operand 7 states. [2020-02-10 20:40:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,086 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2020-02-10 20:40:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:45,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,087 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:40:45,087 INFO L226 Difference]: Without dead ends: 63 [2020-02-10 20:40:45,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-02-10 20:40:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2020-02-10 20:40:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-02-10 20:40:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2020-02-10 20:40:45,088 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 103 transitions. Word has length 16 [2020-02-10 20:40:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,088 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 103 transitions. [2020-02-10 20:40:45,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 103 transitions. [2020-02-10 20:40:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:45,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,089 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1803137139, now seen corresponding path program 109 times [2020-02-10 20:40:45,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418267144] [2020-02-10 20:40:45,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418267144] [2020-02-10 20:40:45,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:45,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426454428] [2020-02-10 20:40:45,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:45,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:45,220 INFO L87 Difference]: Start difference. First operand 53 states and 103 transitions. Second operand 7 states. [2020-02-10 20:40:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,259 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2020-02-10 20:40:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:45,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,260 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:40:45,260 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:40:45,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:40:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2020-02-10 20:40:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-02-10 20:40:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 100 transitions. [2020-02-10 20:40:45,262 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 100 transitions. Word has length 16 [2020-02-10 20:40:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,262 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 100 transitions. [2020-02-10 20:40:45,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 100 transitions. [2020-02-10 20:40:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:45,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,263 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,263 INFO L82 PathProgramCache]: Analyzing trace with hash 627633503, now seen corresponding path program 110 times [2020-02-10 20:40:45,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426972103] [2020-02-10 20:40:45,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426972103] [2020-02-10 20:40:45,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:45,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890066612] [2020-02-10 20:40:45,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:45,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:45,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:45,399 INFO L87 Difference]: Start difference. First operand 53 states and 100 transitions. Second operand 7 states. [2020-02-10 20:40:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,444 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2020-02-10 20:40:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:45,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,445 INFO L225 Difference]: With dead ends: 77 [2020-02-10 20:40:45,445 INFO L226 Difference]: Without dead ends: 66 [2020-02-10 20:40:45,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-02-10 20:40:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2020-02-10 20:40:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:40:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2020-02-10 20:40:45,447 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 16 [2020-02-10 20:40:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,447 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2020-02-10 20:40:45,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2020-02-10 20:40:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:45,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,448 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1821571165, now seen corresponding path program 111 times [2020-02-10 20:40:45,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931189438] [2020-02-10 20:40:45,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931189438] [2020-02-10 20:40:45,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:45,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177058329] [2020-02-10 20:40:45,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:45,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:45,604 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 7 states. [2020-02-10 20:40:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,639 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2020-02-10 20:40:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:45,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,640 INFO L225 Difference]: With dead ends: 73 [2020-02-10 20:40:45,640 INFO L226 Difference]: Without dead ends: 61 [2020-02-10 20:40:45,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-02-10 20:40:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2020-02-10 20:40:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-02-10 20:40:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2020-02-10 20:40:45,642 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 16 [2020-02-10 20:40:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,642 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. [2020-02-10 20:40:45,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2020-02-10 20:40:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:45,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,643 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash 926097059, now seen corresponding path program 112 times [2020-02-10 20:40:45,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474485888] [2020-02-10 20:40:45,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474485888] [2020-02-10 20:40:45,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:45,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946236108] [2020-02-10 20:40:45,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:45,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:45,790 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand 7 states. [2020-02-10 20:40:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,841 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2020-02-10 20:40:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:45,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,842 INFO L225 Difference]: With dead ends: 63 [2020-02-10 20:40:45,842 INFO L226 Difference]: Without dead ends: 50 [2020-02-10 20:40:45,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-02-10 20:40:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-02-10 20:40:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-02-10 20:40:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 70 transitions. [2020-02-10 20:40:45,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 70 transitions. Word has length 16 [2020-02-10 20:40:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,844 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 70 transitions. [2020-02-10 20:40:45,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 70 transitions. [2020-02-10 20:40:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:45,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,844 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1082979805, now seen corresponding path program 113 times [2020-02-10 20:40:45,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520371497] [2020-02-10 20:40:45,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520371497] [2020-02-10 20:40:45,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:45,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77511113] [2020-02-10 20:40:45,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:45,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:45,977 INFO L87 Difference]: Start difference. First operand 40 states and 70 transitions. Second operand 7 states. [2020-02-10 20:40:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,025 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2020-02-10 20:40:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:46,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,026 INFO L225 Difference]: With dead ends: 60 [2020-02-10 20:40:46,026 INFO L226 Difference]: Without dead ends: 52 [2020-02-10 20:40:46,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-02-10 20:40:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2020-02-10 20:40:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-02-10 20:40:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-02-10 20:40:46,028 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 16 [2020-02-10 20:40:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,028 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-02-10 20:40:46,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-02-10 20:40:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:46,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,029 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1082385159, now seen corresponding path program 114 times [2020-02-10 20:40:46,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060114037] [2020-02-10 20:40:46,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060114037] [2020-02-10 20:40:46,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:46,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778725442] [2020-02-10 20:40:46,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:46,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:46,161 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 7 states. [2020-02-10 20:40:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,210 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2020-02-10 20:40:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:46,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,211 INFO L225 Difference]: With dead ends: 51 [2020-02-10 20:40:46,211 INFO L226 Difference]: Without dead ends: 37 [2020-02-10 20:40:46,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-02-10 20:40:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-02-10 20:40:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 20:40:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2020-02-10 20:40:46,213 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 16 [2020-02-10 20:40:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,214 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2020-02-10 20:40:46,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2020-02-10 20:40:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:46,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,215 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1811485409, now seen corresponding path program 115 times [2020-02-10 20:40:46,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735567568] [2020-02-10 20:40:46,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735567568] [2020-02-10 20:40:46,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:46,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393258927] [2020-02-10 20:40:46,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:46,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:46,337 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 7 states. [2020-02-10 20:40:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,384 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2020-02-10 20:40:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:46,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,385 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:40:46,385 INFO L226 Difference]: Without dead ends: 44 [2020-02-10 20:40:46,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-02-10 20:40:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2020-02-10 20:40:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 20:40:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-02-10 20:40:46,387 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 16 [2020-02-10 20:40:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,388 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-02-10 20:40:46,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-02-10 20:40:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:46,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,389 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash -467315489, now seen corresponding path program 116 times [2020-02-10 20:40:46,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708400737] [2020-02-10 20:40:46,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708400737] [2020-02-10 20:40:46,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:46,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855478055] [2020-02-10 20:40:46,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:46,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:46,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:46,507 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 7 states. [2020-02-10 20:40:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,556 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2020-02-10 20:40:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:46,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,557 INFO L225 Difference]: With dead ends: 52 [2020-02-10 20:40:46,557 INFO L226 Difference]: Without dead ends: 42 [2020-02-10 20:40:46,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-02-10 20:40:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-02-10 20:40:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 20:40:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-02-10 20:40:46,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 16 [2020-02-10 20:40:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,559 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-02-10 20:40:46,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-02-10 20:40:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:46,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,560 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1793051383, now seen corresponding path program 117 times [2020-02-10 20:40:46,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023952623] [2020-02-10 20:40:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023952623] [2020-02-10 20:40:46,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:46,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014723810] [2020-02-10 20:40:46,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:46,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:46,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:46,705 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 7 states. [2020-02-10 20:40:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,757 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2020-02-10 20:40:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:46,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,757 INFO L225 Difference]: With dead ends: 48 [2020-02-10 20:40:46,758 INFO L226 Difference]: Without dead ends: 38 [2020-02-10 20:40:46,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-02-10 20:40:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-02-10 20:40:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 20:40:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-02-10 20:40:46,760 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 16 [2020-02-10 20:40:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,760 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-02-10 20:40:46,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-02-10 20:40:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:46,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,761 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1548897127, now seen corresponding path program 118 times [2020-02-10 20:40:46,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317025551] [2020-02-10 20:40:46,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317025551] [2020-02-10 20:40:46,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:46,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280526594] [2020-02-10 20:40:46,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:46,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:46,897 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 7 states. [2020-02-10 20:40:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,944 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-02-10 20:40:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:46,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,945 INFO L225 Difference]: With dead ends: 40 [2020-02-10 20:40:46,945 INFO L226 Difference]: Without dead ends: 28 [2020-02-10 20:40:46,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-02-10 20:40:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-02-10 20:40:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-02-10 20:40:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-02-10 20:40:46,947 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2020-02-10 20:40:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,947 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-02-10 20:40:46,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-02-10 20:40:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:46,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:46,948 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash 406425191, now seen corresponding path program 119 times [2020-02-10 20:40:46,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255815714] [2020-02-10 20:40:46,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:47,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255815714] [2020-02-10 20:40:47,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:47,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:47,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149190585] [2020-02-10 20:40:47,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:47,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:47,105 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 7 states. [2020-02-10 20:40:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,148 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-02-10 20:40:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:47,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,149 INFO L225 Difference]: With dead ends: 34 [2020-02-10 20:40:47,149 INFO L226 Difference]: Without dead ends: 26 [2020-02-10 20:40:47,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-02-10 20:40:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-02-10 20:40:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-02-10 20:40:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-02-10 20:40:47,150 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2020-02-10 20:40:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,150 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-02-10 20:40:47,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-02-10 20:40:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:40:47,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:47,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:47,151 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:40:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 407019837, now seen corresponding path program 120 times [2020-02-10 20:40:47,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:47,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6696797] [2020-02-10 20:40:47,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:47,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6696797] [2020-02-10 20:40:47,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:47,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:40:47,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651143188] [2020-02-10 20:40:47,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:40:47,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:40:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:47,283 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2020-02-10 20:40:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,329 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-02-10 20:40:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:40:47,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:40:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,329 INFO L225 Difference]: With dead ends: 25 [2020-02-10 20:40:47,330 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 20:40:47,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:40:47,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 20:40:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 20:40:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 20:40:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 20:40:47,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-02-10 20:40:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,331 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 20:40:47,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:40:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 20:40:47,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 20:40:47,336 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:40:47 BasicIcfg [2020-02-10 20:40:47,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:40:47,338 INFO L168 Benchmark]: Toolchain (without parser) took 28223.61 ms. Allocated memory was 139.5 MB in the beginning and 438.3 MB in the end (delta: 298.8 MB). Free memory was 119.9 MB in the beginning and 298.7 MB in the end (delta: -178.8 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:47,339 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:40:47,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.01 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 117.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:47,340 INFO L168 Benchmark]: Boogie Preprocessor took 17.22 ms. Allocated memory is still 139.5 MB. Free memory was 117.9 MB in the beginning and 117.0 MB in the end (delta: 938.0 kB). Peak memory consumption was 938.0 kB. Max. memory is 7.1 GB. [2020-02-10 20:40:47,340 INFO L168 Benchmark]: RCFGBuilder took 277.80 ms. Allocated memory is still 139.5 MB. Free memory was 116.7 MB in the beginning and 105.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:47,340 INFO L168 Benchmark]: TraceAbstraction took 27880.03 ms. Allocated memory was 139.5 MB in the beginning and 438.3 MB in the end (delta: 298.8 MB). Free memory was 104.8 MB in the beginning and 298.7 MB in the end (delta: -193.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:47,342 INFO L336 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.01 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 117.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 17.22 ms. Allocated memory is still 139.5 MB. Free memory was 117.9 MB in the beginning and 117.0 MB in the end (delta: 938.0 kB). Peak memory consumption was 938.0 kB. Max. memory is 7.1 GB. * RCFGBuilder took 277.80 ms. Allocated memory is still 139.5 MB. Free memory was 116.7 MB in the beginning and 105.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27880.03 ms. Allocated memory was 139.5 MB in the beginning and 438.3 MB in the end (delta: 298.8 MB). Free memory was 104.8 MB in the beginning and 298.7 MB in the end (delta: -193.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.2s, 44 ProgramPointsBefore, 38 ProgramPointsAfterwards, 48 TransitionsBefore, 42 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 120 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 130 CheckedPairsTotal, 6 TotalNumberOfCompositions - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. Result: SAFE, OverallTime: 27.6s, OverallIterations: 124, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 4412 SDtfs, 6995 SDslu, 6966 SDs, 0 SdLazy, 2498 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 124 MinimizatonAttempts, 3834 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 1984 NumberOfCodeBlocks, 1984 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 1860 ConstructedInterpolants, 0 QuantifiedInterpolants, 417870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 124 InterpolantComputations, 124 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...