/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:43:40,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:43:40,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:43:40,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:43:40,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:43:40,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:43:40,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:43:40,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:43:40,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:43:40,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:43:40,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:43:40,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:43:40,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:43:40,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:43:40,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:43:40,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:43:40,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:43:40,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:43:40,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:43:40,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:43:40,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:43:40,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:43:40,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:43:40,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:43:40,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:43:40,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:43:40,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:43:40,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:43:40,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:43:40,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:43:40,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:43:40,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:43:40,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:43:40,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:43:40,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:43:40,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:43:40,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:43:40,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:43:40,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:43:40,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:43:40,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:43:40,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-02-10 19:43:40,486 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:43:40,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:43:40,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:43:40,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:43:40,491 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:43:40,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:43:40,491 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:43:40,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:43:40,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:43:40,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:43:40,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:43:40,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:43:40,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:43:40,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:43:40,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:40,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:43:40,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:43:40,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:43:40,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:43:40,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:43:40,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:43:40,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:43:40,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:43:40,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:43:40,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:43:40,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:43:40,793 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:43:40,794 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:43:40,794 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 19:43:40,795 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl' [2020-02-10 19:43:40,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:43:40,831 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:43:40,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:40,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:43:40,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:43:40,847 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,857 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:40,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:43:40,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:43:40,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:43:40,878 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,878 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,879 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,879 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,882 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,884 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,885 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 07:43:40" (1/1) ... [2020-02-10 19:43:40,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:43:40,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:43:40,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:43:40,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:43:40,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:40,960 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:43:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:43:40,960 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:43:40,960 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:43:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:43:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:43:40,961 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:43:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:43:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:43:40,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:43:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:43:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:43:40,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:43:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:43:40,963 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:43:40,963 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:43:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:43:40,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:43:40,964 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 19:43:41,167 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:43:41,167 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:43:41,171 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:41 BoogieIcfgContainer [2020-02-10 19:43:41,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:43:41,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:43:41,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:43:41,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:43:41,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:40" (1/2) ... [2020-02-10 19:43:41,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc78642 and model type example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:43:41, skipping insertion in model container [2020-02-10 19:43:41,183 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 07:43:41" (2/2) ... [2020-02-10 19:43:41,188 INFO L109 eAbstractionObserver]: Analyzing ICFG example_5.bpl [2020-02-10 19:43:41,201 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:43:41,201 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:43:41,210 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:43:41,211 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:43:41,321 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-02-10 19:43:41,347 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:43:41,347 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:43:41,348 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:43:41,349 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:43:41,349 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:43:41,349 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:43:41,350 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:43:41,350 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:43:41,364 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 48 transitions [2020-02-10 19:43:41,366 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 48 transitions [2020-02-10 19:43:41,446 INFO L129 PetriNetUnfolder]: 49/98 cut-off events. [2020-02-10 19:43:41,447 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2020-02-10 19:43:41,455 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 19:43:41,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 48 transitions [2020-02-10 19:43:41,516 INFO L129 PetriNetUnfolder]: 49/98 cut-off events. [2020-02-10 19:43:41,517 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2020-02-10 19:43:41,519 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 19:43:41,521 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 440 [2020-02-10 19:43:41,522 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:43:41,638 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130 [2020-02-10 19:43:41,639 INFO L214 etLargeBlockEncoding]: Total number of compositions: 6 [2020-02-10 19:43:41,642 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 42 transitions [2020-02-10 19:43:41,677 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 276 states. [2020-02-10 19:43:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2020-02-10 19:43:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:41,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:41,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:41,699 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 19:43:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash 543435427, now seen corresponding path program 1 times [2020-02-10 19:43:41,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:41,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19945946] [2020-02-10 19:43:41,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:41,857 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 19:43:41,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19945946] [2020-02-10 19:43:41,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:41,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:41,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235553707] [2020-02-10 19:43:41,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:41,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:41,895 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 3 states. [2020-02-10 19:43:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:41,944 INFO L93 Difference]: Finished difference Result 228 states and 684 transitions. [2020-02-10 19:43:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:41,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 19:43:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:41,964 INFO L225 Difference]: With dead ends: 228 [2020-02-10 19:43:41,964 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 19:43:41,966 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 19:43:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 19:43:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2020-02-10 19:43:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-02-10 19:43:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 683 transitions. [2020-02-10 19:43:42,045 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 683 transitions. Word has length 16 [2020-02-10 19:43:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,047 INFO L479 AbstractCegarLoop]: Abstraction has 227 states and 683 transitions. [2020-02-10 19:43:42,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 683 transitions. [2020-02-10 19:43:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:42,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,051 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 19:43:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash 867723203, now seen corresponding path program 1 times [2020-02-10 19:43:42,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306413164] [2020-02-10 19:43:42,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,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 19:43:42,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306413164] [2020-02-10 19:43:42,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:42,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511137409] [2020-02-10 19:43:42,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:42,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:42,097 INFO L87 Difference]: Start difference. First operand 227 states and 683 transitions. Second operand 3 states. [2020-02-10 19:43:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,135 INFO L93 Difference]: Finished difference Result 211 states and 611 transitions. [2020-02-10 19:43:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:42,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 19:43:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,140 INFO L225 Difference]: With dead ends: 211 [2020-02-10 19:43:42,140 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 19:43:42,141 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 19:43:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 19:43:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-02-10 19:43:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 19:43:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 611 transitions. [2020-02-10 19:43:42,176 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 611 transitions. Word has length 16 [2020-02-10 19:43:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,177 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 611 transitions. [2020-02-10 19:43:42,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 611 transitions. [2020-02-10 19:43:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:42,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,183 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 19:43:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1800356309, now seen corresponding path program 1 times [2020-02-10 19:43:42,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007383078] [2020-02-10 19:43:42,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,228 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 19:43:42,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007383078] [2020-02-10 19:43:42,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:42,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116422894] [2020-02-10 19:43:42,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:42,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:42,231 INFO L87 Difference]: Start difference. First operand 211 states and 611 transitions. Second operand 3 states. [2020-02-10 19:43:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,251 INFO L93 Difference]: Finished difference Result 147 states and 391 transitions. [2020-02-10 19:43:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:42,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 19:43:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,255 INFO L225 Difference]: With dead ends: 147 [2020-02-10 19:43:42,255 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 19:43:42,255 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 19:43:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 19:43:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-02-10 19:43:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:43:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 391 transitions. [2020-02-10 19:43:42,275 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 391 transitions. Word has length 16 [2020-02-10 19:43:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,276 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 391 transitions. [2020-02-10 19:43:42,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 391 transitions. [2020-02-10 19:43:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:42,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,278 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 19:43:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 536228197, now seen corresponding path program 1 times [2020-02-10 19:43:42,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913385006] [2020-02-10 19:43:42,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,305 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 19:43:42,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913385006] [2020-02-10 19:43:42,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:42,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203147886] [2020-02-10 19:43:42,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:42,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:42,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:42,308 INFO L87 Difference]: Start difference. First operand 147 states and 391 transitions. Second operand 3 states. [2020-02-10 19:43:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,317 INFO L93 Difference]: Finished difference Result 95 states and 241 transitions. [2020-02-10 19:43:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:42,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 19:43:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,319 INFO L225 Difference]: With dead ends: 95 [2020-02-10 19:43:42,319 INFO L226 Difference]: Without dead ends: 95 [2020-02-10 19:43:42,320 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 19:43:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-02-10 19:43:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-02-10 19:43:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:43:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-02-10 19:43:42,326 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 16 [2020-02-10 19:43:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,326 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-02-10 19:43:42,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-02-10 19:43:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:42,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,328 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 19:43:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1934968637, now seen corresponding path program 1 times [2020-02-10 19:43:42,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249886612] [2020-02-10 19:43:42,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,791 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 19:43:42,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249886612] [2020-02-10 19:43:42,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:42,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837402490] [2020-02-10 19:43:42,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:42,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:42,794 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 7 states. [2020-02-10 19:43:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,877 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-02-10 19:43:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:42,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,879 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:43:42,879 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 19:43:42,880 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 19:43:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 19:43:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2020-02-10 19:43:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-02-10 19:43:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 252 transitions. [2020-02-10 19:43:42,888 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 252 transitions. Word has length 16 [2020-02-10 19:43:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,888 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 252 transitions. [2020-02-10 19:43:42,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 252 transitions. [2020-02-10 19:43:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:42,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,890 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 19:43:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1391533921, now seen corresponding path program 2 times [2020-02-10 19:43:42,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257719855] [2020-02-10 19:43:42,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43: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 19:43:43,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257719855] [2020-02-10 19:43:43,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:43,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:43,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118624265] [2020-02-10 19:43:43,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:43,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:43,160 INFO L87 Difference]: Start difference. First operand 100 states and 252 transitions. Second operand 7 states. [2020-02-10 19:43:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:43,237 INFO L93 Difference]: Finished difference Result 160 states and 334 transitions. [2020-02-10 19:43:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:43,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:43,239 INFO L225 Difference]: With dead ends: 160 [2020-02-10 19:43:43,239 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 19:43:43,240 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 19:43:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 19:43:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2020-02-10 19:43:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 19:43:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-02-10 19:43:43,245 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 16 [2020-02-10 19:43:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:43,246 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-02-10 19:43:43,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-02-10 19:43:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:43,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:43,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:43,247 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 19:43:43,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:43,248 INFO L82 PathProgramCache]: Analyzing trace with hash -870593663, now seen corresponding path program 3 times [2020-02-10 19:43:43,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:43,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250372579] [2020-02-10 19:43:43,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:43,518 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 19:43:43,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250372579] [2020-02-10 19:43:43,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:43,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:43,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594325157] [2020-02-10 19:43:43,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:43,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:43,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:43,520 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 7 states. [2020-02-10 19:43:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:43,595 INFO L93 Difference]: Finished difference Result 152 states and 319 transitions. [2020-02-10 19:43:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:43,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:43,597 INFO L225 Difference]: With dead ends: 152 [2020-02-10 19:43:43,597 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:43:43,598 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 19:43:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:43:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2020-02-10 19:43:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 19:43:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 248 transitions. [2020-02-10 19:43:43,606 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 248 transitions. Word has length 16 [2020-02-10 19:43:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:43,607 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 248 transitions. [2020-02-10 19:43:43,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 248 transitions. [2020-02-10 19:43:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:43,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:43,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:43,608 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 19:43:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2071878669, now seen corresponding path program 4 times [2020-02-10 19:43:43,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:43,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124514666] [2020-02-10 19:43:43,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:43,836 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 19:43:43,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124514666] [2020-02-10 19:43:43,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:43,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:43,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883565398] [2020-02-10 19:43:43,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:43,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:43,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:43,839 INFO L87 Difference]: Start difference. First operand 99 states and 248 transitions. Second operand 7 states. [2020-02-10 19:43:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:43,920 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 19:43:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:43,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:43,923 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:43:43,923 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 19:43:43,923 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 19:43:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 19:43:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2020-02-10 19:43:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 19:43:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 246 transitions. [2020-02-10 19:43:43,929 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 246 transitions. Word has length 16 [2020-02-10 19:43:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:43,930 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 246 transitions. [2020-02-10 19:43:43,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 246 transitions. [2020-02-10 19:43:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:43,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:43,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:43,931 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 19:43:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1881104299, now seen corresponding path program 5 times [2020-02-10 19:43:43,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:43,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174497698] [2020-02-10 19:43:43,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:44,200 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 19:43:44,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174497698] [2020-02-10 19:43:44,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:44,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:44,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908837895] [2020-02-10 19:43:44,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:44,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:44,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:44,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:44,204 INFO L87 Difference]: Start difference. First operand 98 states and 246 transitions. Second operand 7 states. [2020-02-10 19:43:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:44,256 INFO L93 Difference]: Finished difference Result 167 states and 348 transitions. [2020-02-10 19:43:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:44,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:44,257 INFO L225 Difference]: With dead ends: 167 [2020-02-10 19:43:44,258 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 19:43:44,258 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 19:43:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 19:43:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 104. [2020-02-10 19:43:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 19:43:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 255 transitions. [2020-02-10 19:43:44,263 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 255 transitions. Word has length 16 [2020-02-10 19:43:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:44,264 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 255 transitions. [2020-02-10 19:43:44,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 255 transitions. [2020-02-10 19:43:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:44,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:44,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:44,265 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 19:43:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:44,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1878970879, now seen corresponding path program 6 times [2020-02-10 19:43:44,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:44,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880166796] [2020-02-10 19:43:44,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:44,418 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 19:43:44,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880166796] [2020-02-10 19:43:44,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:44,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:44,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934363514] [2020-02-10 19:43:44,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:44,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:44,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:44,420 INFO L87 Difference]: Start difference. First operand 104 states and 255 transitions. Second operand 7 states. [2020-02-10 19:43:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:44,486 INFO L93 Difference]: Finished difference Result 165 states and 340 transitions. [2020-02-10 19:43:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:44,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:44,489 INFO L225 Difference]: With dead ends: 165 [2020-02-10 19:43:44,489 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 19:43:44,490 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 19:43:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 19:43:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2020-02-10 19:43:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:43:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 19:43:44,495 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 16 [2020-02-10 19:43:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:44,495 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 19:43:44,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 19:43:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:44,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:44,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 19:43:44,497 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 19:43:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1274477111, now seen corresponding path program 7 times [2020-02-10 19:43:44,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:44,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014553029] [2020-02-10 19:43:44,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:44,689 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 19:43:44,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014553029] [2020-02-10 19:43:44,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:44,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:44,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538539633] [2020-02-10 19:43:44,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:44,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:44,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:44,691 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 7 states. [2020-02-10 19:43:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:44,756 INFO L93 Difference]: Finished difference Result 151 states and 315 transitions. [2020-02-10 19:43:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:44,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:44,758 INFO L225 Difference]: With dead ends: 151 [2020-02-10 19:43:44,758 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 19:43:44,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 19:43:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 19:43:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 99. [2020-02-10 19:43:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 19:43:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 247 transitions. [2020-02-10 19:43:44,763 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 247 transitions. Word has length 16 [2020-02-10 19:43:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:44,763 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 247 transitions. [2020-02-10 19:43:44,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 247 transitions. [2020-02-10 19:43:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:44,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:44,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:44,765 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 19:43:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1817911827, now seen corresponding path program 8 times [2020-02-10 19:43:44,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:44,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037714217] [2020-02-10 19:43:44,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:44,912 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 19:43:44,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037714217] [2020-02-10 19:43:44,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:44,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:44,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279856039] [2020-02-10 19:43:44,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:44,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:44,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:44,914 INFO L87 Difference]: Start difference. First operand 99 states and 247 transitions. Second operand 7 states. [2020-02-10 19:43:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:44,977 INFO L93 Difference]: Finished difference Result 156 states and 323 transitions. [2020-02-10 19:43:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:44,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:44,980 INFO L225 Difference]: With dead ends: 156 [2020-02-10 19:43:44,980 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 19:43:44,981 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 19:43:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 19:43:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 97. [2020-02-10 19:43:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:43:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-02-10 19:43:44,986 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 16 [2020-02-10 19:43:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:44,986 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-02-10 19:43:44,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-02-10 19:43:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:44,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:44,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:44,988 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 19:43:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:44,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1531085189, now seen corresponding path program 9 times [2020-02-10 19:43:44,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:44,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707192015] [2020-02-10 19:43:44,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:45,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 19:43:45,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707192015] [2020-02-10 19:43:45,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:45,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977994490] [2020-02-10 19:43:45,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:45,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:45,310 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 7 states. [2020-02-10 19:43:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:45,357 INFO L93 Difference]: Finished difference Result 147 states and 306 transitions. [2020-02-10 19:43:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:45,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:45,359 INFO L225 Difference]: With dead ends: 147 [2020-02-10 19:43:45,359 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 19:43:45,359 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 19:43:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 19:43:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2020-02-10 19:43:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 19:43:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 243 transitions. [2020-02-10 19:43:45,364 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 243 transitions. Word has length 16 [2020-02-10 19:43:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:45,364 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 243 transitions. [2020-02-10 19:43:45,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 243 transitions. [2020-02-10 19:43:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:45,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:45,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:45,365 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 19:43:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:45,366 INFO L82 PathProgramCache]: Analyzing trace with hash 675778535, now seen corresponding path program 10 times [2020-02-10 19:43:45,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:45,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888451476] [2020-02-10 19:43:45,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:45,516 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 19:43:45,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888451476] [2020-02-10 19:43:45,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:45,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024108534] [2020-02-10 19:43:45,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:45,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:45,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:45,519 INFO L87 Difference]: Start difference. First operand 98 states and 243 transitions. Second operand 7 states. [2020-02-10 19:43:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:45,605 INFO L93 Difference]: Finished difference Result 149 states and 309 transitions. [2020-02-10 19:43:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:45,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:45,606 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:43:45,606 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 19:43:45,607 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 19:43:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 19:43:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2020-02-10 19:43:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:43:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-02-10 19:43:45,611 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 16 [2020-02-10 19:43:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:45,611 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-02-10 19:43:45,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-02-10 19:43:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:45,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:45,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:45,613 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 19:43:45,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:45,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1732352971, now seen corresponding path program 11 times [2020-02-10 19:43:45,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:45,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198378854] [2020-02-10 19:43:45,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:45,768 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 19:43:45,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198378854] [2020-02-10 19:43:45,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:45,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612875798] [2020-02-10 19:43:45,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:45,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:45,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:45,770 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 7 states. [2020-02-10 19:43:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:45,816 INFO L93 Difference]: Finished difference Result 160 states and 331 transitions. [2020-02-10 19:43:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:45,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:45,818 INFO L225 Difference]: With dead ends: 160 [2020-02-10 19:43:45,818 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 19:43:45,818 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 19:43:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 19:43:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 101. [2020-02-10 19:43:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 19:43:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 247 transitions. [2020-02-10 19:43:45,823 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 247 transitions. Word has length 16 [2020-02-10 19:43:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:45,824 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 247 transitions. [2020-02-10 19:43:45,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 247 transitions. [2020-02-10 19:43:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:45,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:45,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:45,825 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 19:43:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1636870967, now seen corresponding path program 12 times [2020-02-10 19:43:45,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:45,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15727151] [2020-02-10 19:43:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:45,962 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 19:43:45,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15727151] [2020-02-10 19:43:45,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:45,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417483969] [2020-02-10 19:43:45,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:45,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:45,964 INFO L87 Difference]: Start difference. First operand 101 states and 247 transitions. Second operand 7 states. [2020-02-10 19:43:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,021 INFO L93 Difference]: Finished difference Result 157 states and 322 transitions. [2020-02-10 19:43:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:46,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,023 INFO L225 Difference]: With dead ends: 157 [2020-02-10 19:43:46,023 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 19:43:46,023 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 19:43:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 19:43:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2020-02-10 19:43:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:43:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 236 transitions. [2020-02-10 19:43:46,028 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 236 transitions. Word has length 16 [2020-02-10 19:43:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,028 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 236 transitions. [2020-02-10 19:43:46,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 236 transitions. [2020-02-10 19:43:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:46,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43: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 19:43:46,029 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 19:43:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash -858157495, now seen corresponding path program 13 times [2020-02-10 19:43:46,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491555925] [2020-02-10 19:43:46,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,175 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 19:43:46,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491555925] [2020-02-10 19:43:46,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:46,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178852471] [2020-02-10 19:43:46,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:46,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:46,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:46,177 INFO L87 Difference]: Start difference. First operand 95 states and 236 transitions. Second operand 7 states. [2020-02-10 19:43:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,226 INFO L93 Difference]: Finished difference Result 143 states and 298 transitions. [2020-02-10 19:43:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:46,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,228 INFO L225 Difference]: With dead ends: 143 [2020-02-10 19:43:46,228 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 19:43:46,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 19:43:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 19:43:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 97. [2020-02-10 19:43:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:43:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 240 transitions. [2020-02-10 19:43:46,233 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 240 transitions. Word has length 16 [2020-02-10 19:43:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,233 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 240 transitions. [2020-02-10 19:43:46,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 240 transitions. [2020-02-10 19:43:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:46,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:46,235 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 19:43:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2084314837, now seen corresponding path program 14 times [2020-02-10 19:43:46,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578202743] [2020-02-10 19:43:46,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,392 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 19:43:46,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578202743] [2020-02-10 19:43:46,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:46,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087357703] [2020-02-10 19:43:46,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:46,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:46,394 INFO L87 Difference]: Start difference. First operand 97 states and 240 transitions. Second operand 7 states. [2020-02-10 19:43:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,462 INFO L93 Difference]: Finished difference Result 146 states and 303 transitions. [2020-02-10 19:43:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:46,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,463 INFO L225 Difference]: With dead ends: 146 [2020-02-10 19:43:46,464 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 19:43:46,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 19:43:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 19:43:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2020-02-10 19:43:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-02-10 19:43:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 238 transitions. [2020-02-10 19:43:46,468 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 238 transitions. Word has length 16 [2020-02-10 19:43:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,468 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 238 transitions. [2020-02-10 19:43:46,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 238 transitions. [2020-02-10 19:43:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:46,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:46,470 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 19:43:46,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,470 INFO L82 PathProgramCache]: Analyzing trace with hash 457999809, now seen corresponding path program 15 times [2020-02-10 19:43:46,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213112644] [2020-02-10 19:43:46,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,641 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 19:43:46,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213112644] [2020-02-10 19:43:46,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:46,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233013980] [2020-02-10 19:43:46,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:46,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:46,643 INFO L87 Difference]: Start difference. First operand 96 states and 238 transitions. Second operand 7 states. [2020-02-10 19:43:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,696 INFO L93 Difference]: Finished difference Result 142 states and 295 transitions. [2020-02-10 19:43:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:46,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,698 INFO L225 Difference]: With dead ends: 142 [2020-02-10 19:43:46,698 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 19:43:46,699 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 19:43:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 19:43:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2020-02-10 19:43:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:43:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 239 transitions. [2020-02-10 19:43:46,705 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 239 transitions. Word has length 16 [2020-02-10 19:43:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,705 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 239 transitions. [2020-02-10 19:43:46,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 239 transitions. [2020-02-10 19:43:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:46,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:46,707 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 19:43:46,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash -397306845, now seen corresponding path program 16 times [2020-02-10 19:43:46,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135796218] [2020-02-10 19:43:46,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,858 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 19:43:46,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135796218] [2020-02-10 19:43:46,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:46,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792881563] [2020-02-10 19:43:46,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:46,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:46,861 INFO L87 Difference]: Start difference. First operand 97 states and 239 transitions. Second operand 7 states. [2020-02-10 19:43:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,921 INFO L93 Difference]: Finished difference Result 144 states and 298 transitions. [2020-02-10 19:43:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:46,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,922 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:43:46,923 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:43:46,923 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 19:43:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:43:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-02-10 19:43:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-02-10 19:43:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 237 transitions. [2020-02-10 19:43:46,927 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 237 transitions. Word has length 16 [2020-02-10 19:43:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,927 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 237 transitions. [2020-02-10 19:43:46,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 237 transitions. [2020-02-10 19:43:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:46,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:46,929 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 19:43:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1339612339, now seen corresponding path program 17 times [2020-02-10 19:43:46,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142331764] [2020-02-10 19:43:46,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:47,061 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 19:43:47,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142331764] [2020-02-10 19:43:47,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:47,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:47,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202890614] [2020-02-10 19:43:47,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:47,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:47,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:47,063 INFO L87 Difference]: Start difference. First operand 96 states and 237 transitions. Second operand 7 states. [2020-02-10 19:43:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,123 INFO L93 Difference]: Finished difference Result 150 states and 312 transitions. [2020-02-10 19:43:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:47,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,125 INFO L225 Difference]: With dead ends: 150 [2020-02-10 19:43:47,125 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 19:43:47,126 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 19:43:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 19:43:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2020-02-10 19:43:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 19:43:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 242 transitions. [2020-02-10 19:43:47,130 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 242 transitions. Word has length 16 [2020-02-10 19:43:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,131 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 242 transitions. [2020-02-10 19:43:47,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 242 transitions. [2020-02-10 19:43:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:47,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:47,132 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 19:43:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2087156279, now seen corresponding path program 18 times [2020-02-10 19:43:47,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034606350] [2020-02-10 19:43:47,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:47,272 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 19:43:47,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034606350] [2020-02-10 19:43:47,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:47,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:47,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296994797] [2020-02-10 19:43:47,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:47,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:47,274 INFO L87 Difference]: Start difference. First operand 99 states and 242 transitions. Second operand 7 states. [2020-02-10 19:43:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,345 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-02-10 19:43:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:47,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,347 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:43:47,347 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 19:43:47,347 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 19:43:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 19:43:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2020-02-10 19:43:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:43:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 235 transitions. [2020-02-10 19:43:47,351 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 235 transitions. Word has length 16 [2020-02-10 19:43:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,351 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 235 transitions. [2020-02-10 19:43:47,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 235 transitions. [2020-02-10 19:43:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:47,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:47,352 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 19:43:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash -257727173, now seen corresponding path program 19 times [2020-02-10 19:43:47,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196085226] [2020-02-10 19:43:47,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:47,550 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 19:43:47,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196085226] [2020-02-10 19:43:47,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:47,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:47,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372366008] [2020-02-10 19:43:47,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:47,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:47,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:47,553 INFO L87 Difference]: Start difference. First operand 95 states and 235 transitions. Second operand 7 states. [2020-02-10 19:43:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,611 INFO L93 Difference]: Finished difference Result 176 states and 370 transitions. [2020-02-10 19:43:47,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:47,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,613 INFO L225 Difference]: With dead ends: 176 [2020-02-10 19:43:47,613 INFO L226 Difference]: Without dead ends: 164 [2020-02-10 19:43:47,614 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 19:43:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-02-10 19:43:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 107. [2020-02-10 19:43:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-02-10 19:43:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 261 transitions. [2020-02-10 19:43:47,621 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 261 transitions. Word has length 16 [2020-02-10 19:43:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,621 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 261 transitions. [2020-02-10 19:43:47,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 261 transitions. [2020-02-10 19:43:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:47,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:47,623 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 19:43:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,623 INFO L82 PathProgramCache]: Analyzing trace with hash -255593753, now seen corresponding path program 20 times [2020-02-10 19:43:47,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103296900] [2020-02-10 19:43:47,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:47,806 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 19:43:47,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103296900] [2020-02-10 19:43:47,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:47,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:47,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111473133] [2020-02-10 19:43:47,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:47,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:47,808 INFO L87 Difference]: Start difference. First operand 107 states and 261 transitions. Second operand 7 states. [2020-02-10 19:43:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,897 INFO L93 Difference]: Finished difference Result 174 states and 362 transitions. [2020-02-10 19:43:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:47,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,899 INFO L225 Difference]: With dead ends: 174 [2020-02-10 19:43:47,899 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 19:43:47,899 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 19:43:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 19:43:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2020-02-10 19:43:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 19:43:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 247 transitions. [2020-02-10 19:43:47,905 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 247 transitions. Word has length 16 [2020-02-10 19:43:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,905 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 247 transitions. [2020-02-10 19:43:47,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 247 transitions. [2020-02-10 19:43:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:47,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:47,906 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 19:43:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,906 INFO L82 PathProgramCache]: Analyzing trace with hash 886628069, now seen corresponding path program 21 times [2020-02-10 19:43:47,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386699101] [2020-02-10 19:43:47,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,058 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 19:43:48,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386699101] [2020-02-10 19:43:48,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:48,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284055007] [2020-02-10 19:43:48,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:48,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:48,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:48,060 INFO L87 Difference]: Start difference. First operand 101 states and 247 transitions. Second operand 7 states. [2020-02-10 19:43:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,104 INFO L93 Difference]: Finished difference Result 173 states and 359 transitions. [2020-02-10 19:43:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:48,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,106 INFO L225 Difference]: With dead ends: 173 [2020-02-10 19:43:48,106 INFO L226 Difference]: Without dead ends: 161 [2020-02-10 19:43:48,107 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 19:43:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-02-10 19:43:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2020-02-10 19:43:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-02-10 19:43:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 253 transitions. [2020-02-10 19:43:48,112 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 253 transitions. Word has length 16 [2020-02-10 19:43:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,112 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 253 transitions. [2020-02-10 19:43:48,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 253 transitions. [2020-02-10 19:43:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:48,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:48,113 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 19:43:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash 847649909, now seen corresponding path program 22 times [2020-02-10 19:43:48,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312457018] [2020-02-10 19:43:48,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,287 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 19:43:48,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312457018] [2020-02-10 19:43:48,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:48,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101082116] [2020-02-10 19:43:48,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:48,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:48,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:48,290 INFO L87 Difference]: Start difference. First operand 105 states and 253 transitions. Second operand 7 states. [2020-02-10 19:43:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,351 INFO L93 Difference]: Finished difference Result 170 states and 350 transitions. [2020-02-10 19:43:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:48,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,353 INFO L225 Difference]: With dead ends: 170 [2020-02-10 19:43:48,353 INFO L226 Difference]: Without dead ends: 157 [2020-02-10 19:43:48,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 19:43:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-02-10 19:43:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2020-02-10 19:43:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 19:43:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 243 transitions. [2020-02-10 19:43:48,358 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 243 transitions. Word has length 16 [2020-02-10 19:43:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,358 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 243 transitions. [2020-02-10 19:43:48,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 243 transitions. [2020-02-10 19:43:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:48,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:48,360 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 19:43:48,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1633045487, now seen corresponding path program 23 times [2020-02-10 19:43:48,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433741002] [2020-02-10 19:43:48,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,504 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 19:43:48,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433741002] [2020-02-10 19:43:48,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:48,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922319450] [2020-02-10 19:43:48,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:48,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:48,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:48,506 INFO L87 Difference]: Start difference. First operand 101 states and 243 transitions. Second operand 7 states. [2020-02-10 19:43:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,572 INFO L93 Difference]: Finished difference Result 168 states and 347 transitions. [2020-02-10 19:43:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:48,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,574 INFO L225 Difference]: With dead ends: 168 [2020-02-10 19:43:48,574 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 19:43:48,575 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 19:43:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 19:43:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 104. [2020-02-10 19:43:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 19:43:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 248 transitions. [2020-02-10 19:43:48,581 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 248 transitions. Word has length 16 [2020-02-10 19:43:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,581 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 248 transitions. [2020-02-10 19:43:48,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 248 transitions. [2020-02-10 19:43:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:48,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:48,582 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 19:43:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1729568327, now seen corresponding path program 24 times [2020-02-10 19:43:48,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895629539] [2020-02-10 19:43:48,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,748 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 19:43:48,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895629539] [2020-02-10 19:43:48,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:48,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507232675] [2020-02-10 19:43:48,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:48,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:48,750 INFO L87 Difference]: Start difference. First operand 104 states and 248 transitions. Second operand 7 states. [2020-02-10 19:43:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,821 INFO L93 Difference]: Finished difference Result 167 states and 342 transitions. [2020-02-10 19:43:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:48,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,823 INFO L225 Difference]: With dead ends: 167 [2020-02-10 19:43:48,823 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:43:48,823 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 19:43:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:43:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2020-02-10 19:43:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:43:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 224 transitions. [2020-02-10 19:43:48,828 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 224 transitions. Word has length 16 [2020-02-10 19:43:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,828 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 224 transitions. [2020-02-10 19:43:48,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 224 transitions. [2020-02-10 19:43:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:48,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:48,829 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 19:43:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1892241251, now seen corresponding path program 25 times [2020-02-10 19:43:48,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765669771] [2020-02-10 19:43:48,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,998 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 19:43:48,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765669771] [2020-02-10 19:43:48,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:48,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091605001] [2020-02-10 19:43:49,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:49,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:49,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:49,000 INFO L87 Difference]: Start difference. First operand 91 states and 224 transitions. Second operand 7 states. [2020-02-10 19:43:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,045 INFO L93 Difference]: Finished difference Result 148 states and 301 transitions. [2020-02-10 19:43:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:49,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,047 INFO L225 Difference]: With dead ends: 148 [2020-02-10 19:43:49,047 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 19:43:49,048 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 19:43:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 19:43:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2020-02-10 19:43:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:43:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 227 transitions. [2020-02-10 19:43:49,053 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 227 transitions. Word has length 16 [2020-02-10 19:43:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,054 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 227 transitions. [2020-02-10 19:43:49,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 227 transitions. [2020-02-10 19:43:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:49,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,055 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 19:43:49,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1348806535, now seen corresponding path program 26 times [2020-02-10 19:43:49,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887561078] [2020-02-10 19:43:49,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,213 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 19:43:49,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887561078] [2020-02-10 19:43:49,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:49,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90706173] [2020-02-10 19:43:49,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:49,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:49,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:49,215 INFO L87 Difference]: Start difference. First operand 93 states and 227 transitions. Second operand 7 states. [2020-02-10 19:43:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,264 INFO L93 Difference]: Finished difference Result 153 states and 309 transitions. [2020-02-10 19:43:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:49,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,266 INFO L225 Difference]: With dead ends: 153 [2020-02-10 19:43:49,266 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 19:43:49,267 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 19:43:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 19:43:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2020-02-10 19:43:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:43:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 222 transitions. [2020-02-10 19:43:49,271 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 222 transitions. Word has length 16 [2020-02-10 19:43:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,271 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 222 transitions. [2020-02-10 19:43:49,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 222 transitions. [2020-02-10 19:43:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:49,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,272 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 19:43:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash -913321049, now seen corresponding path program 27 times [2020-02-10 19:43:49,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460145059] [2020-02-10 19:43:49,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,439 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 19:43:49,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460145059] [2020-02-10 19:43:49,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:49,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071920656] [2020-02-10 19:43:49,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:49,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:49,441 INFO L87 Difference]: Start difference. First operand 91 states and 222 transitions. Second operand 7 states. [2020-02-10 19:43:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,494 INFO L93 Difference]: Finished difference Result 145 states and 294 transitions. [2020-02-10 19:43:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:49,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,495 INFO L225 Difference]: With dead ends: 145 [2020-02-10 19:43:49,496 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 19:43:49,496 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 19:43:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 19:43:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2020-02-10 19:43:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:43:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 223 transitions. [2020-02-10 19:43:49,501 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 223 transitions. Word has length 16 [2020-02-10 19:43:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,501 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 223 transitions. [2020-02-10 19:43:49,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 223 transitions. [2020-02-10 19:43:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:49,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,502 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 19:43:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2029151283, now seen corresponding path program 28 times [2020-02-10 19:43:49,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18873470] [2020-02-10 19:43:49,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,644 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 19:43:49,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18873470] [2020-02-10 19:43:49,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:49,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605790808] [2020-02-10 19:43:49,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:49,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:49,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:49,646 INFO L87 Difference]: Start difference. First operand 92 states and 223 transitions. Second operand 7 states. [2020-02-10 19:43:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,706 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-02-10 19:43:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:49,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,708 INFO L225 Difference]: With dead ends: 148 [2020-02-10 19:43:49,708 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 19:43:49,708 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 19:43:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 19:43:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 19:43:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:43:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 221 transitions. [2020-02-10 19:43:49,713 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 221 transitions. Word has length 16 [2020-02-10 19:43:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,714 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 221 transitions. [2020-02-10 19:43:49,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 221 transitions. [2020-02-10 19:43:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:49,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,715 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 19:43:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1923831685, now seen corresponding path program 29 times [2020-02-10 19:43:49,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983678218] [2020-02-10 19:43:49,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,872 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 19:43:49,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983678218] [2020-02-10 19:43:49,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:49,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830581838] [2020-02-10 19:43:49,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:49,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:49,874 INFO L87 Difference]: Start difference. First operand 91 states and 221 transitions. Second operand 7 states. [2020-02-10 19:43:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,922 INFO L93 Difference]: Finished difference Result 160 states and 323 transitions. [2020-02-10 19:43:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:49,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,924 INFO L225 Difference]: With dead ends: 160 [2020-02-10 19:43:49,924 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 19:43:49,925 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 19:43:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 19:43:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2020-02-10 19:43:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:43:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 230 transitions. [2020-02-10 19:43:49,929 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 230 transitions. Word has length 16 [2020-02-10 19:43:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,930 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 230 transitions. [2020-02-10 19:43:49,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 230 transitions. [2020-02-10 19:43:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:49,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,931 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 19:43:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1921698265, now seen corresponding path program 30 times [2020-02-10 19:43:49,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160550591] [2020-02-10 19:43:49,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,088 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 19:43:50,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160550591] [2020-02-10 19:43:50,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:50,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182746077] [2020-02-10 19:43:50,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:50,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:50,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:50,090 INFO L87 Difference]: Start difference. First operand 97 states and 230 transitions. Second operand 7 states. [2020-02-10 19:43:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,148 INFO L93 Difference]: Finished difference Result 158 states and 315 transitions. [2020-02-10 19:43:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:50,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,149 INFO L225 Difference]: With dead ends: 158 [2020-02-10 19:43:50,150 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 19:43:50,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 19:43:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 19:43:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 88. [2020-02-10 19:43:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:43:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 213 transitions. [2020-02-10 19:43:50,153 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 213 transitions. Word has length 16 [2020-02-10 19:43:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,154 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 213 transitions. [2020-02-10 19:43:50,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 213 transitions. [2020-02-10 19:43:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:50,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,155 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 19:43:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -224453179, now seen corresponding path program 31 times [2020-02-10 19:43:50,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274077316] [2020-02-10 19:43:50,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,301 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 19:43:50,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274077316] [2020-02-10 19:43:50,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:50,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834134273] [2020-02-10 19:43:50,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:50,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:50,303 INFO L87 Difference]: Start difference. First operand 88 states and 213 transitions. Second operand 7 states. [2020-02-10 19:43:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,344 INFO L93 Difference]: Finished difference Result 140 states and 281 transitions. [2020-02-10 19:43:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:50,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,346 INFO L225 Difference]: With dead ends: 140 [2020-02-10 19:43:50,346 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 19:43:50,346 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 19:43:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 19:43:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2020-02-10 19:43:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:43:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 222 transitions. [2020-02-10 19:43:50,350 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 222 transitions. Word has length 16 [2020-02-10 19:43:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,350 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 222 transitions. [2020-02-10 19:43:50,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 222 transitions. [2020-02-10 19:43:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:50,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,351 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 19:43:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash -767887895, now seen corresponding path program 32 times [2020-02-10 19:43:50,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485743824] [2020-02-10 19:43:50,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,492 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 19:43:50,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485743824] [2020-02-10 19:43:50,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:50,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902042545] [2020-02-10 19:43:50,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:50,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:50,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:50,494 INFO L87 Difference]: Start difference. First operand 92 states and 222 transitions. Second operand 7 states. [2020-02-10 19:43:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,547 INFO L93 Difference]: Finished difference Result 145 states and 289 transitions. [2020-02-10 19:43:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:50,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,549 INFO L225 Difference]: With dead ends: 145 [2020-02-10 19:43:50,549 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 19:43:50,549 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 19:43:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 19:43:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2020-02-10 19:43:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:43:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 217 transitions. [2020-02-10 19:43:50,552 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 217 transitions. Word has length 16 [2020-02-10 19:43:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,552 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 217 transitions. [2020-02-10 19:43:50,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 217 transitions. [2020-02-10 19:43:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:50,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,553 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 19:43:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2009654315, now seen corresponding path program 33 times [2020-02-10 19:43:50,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555073204] [2020-02-10 19:43:50,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,732 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 19:43:50,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555073204] [2020-02-10 19:43:50,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:50,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909221807] [2020-02-10 19:43:50,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:50,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:50,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:50,734 INFO L87 Difference]: Start difference. First operand 90 states and 217 transitions. Second operand 7 states. [2020-02-10 19:43:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,804 INFO L93 Difference]: Finished difference Result 134 states and 269 transitions. [2020-02-10 19:43:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:50,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,805 INFO L225 Difference]: With dead ends: 134 [2020-02-10 19:43:50,806 INFO L226 Difference]: Without dead ends: 127 [2020-02-10 19:43:50,806 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 19:43:50,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-02-10 19:43:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2020-02-10 19:43:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:43:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 218 transitions. [2020-02-10 19:43:50,809 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 218 transitions. Word has length 16 [2020-02-10 19:43:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,809 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 218 transitions. [2020-02-10 19:43:50,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 218 transitions. [2020-02-10 19:43:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:50,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,810 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 19:43:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1438331371, now seen corresponding path program 34 times [2020-02-10 19:43:50,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027159364] [2020-02-10 19:43:50,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,977 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 19:43:50,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027159364] [2020-02-10 19:43:50,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:50,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053909026] [2020-02-10 19:43:50,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:50,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:50,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:50,979 INFO L87 Difference]: Start difference. First operand 91 states and 218 transitions. Second operand 7 states. [2020-02-10 19:43:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,041 INFO L93 Difference]: Finished difference Result 128 states and 264 transitions. [2020-02-10 19:43:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:51,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,042 INFO L225 Difference]: With dead ends: 128 [2020-02-10 19:43:51,043 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 19:43:51,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 19:43:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 19:43:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2020-02-10 19:43:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:43:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 216 transitions. [2020-02-10 19:43:51,046 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 216 transitions. Word has length 16 [2020-02-10 19:43:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,047 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 216 transitions. [2020-02-10 19:43:51,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 216 transitions. [2020-02-10 19:43:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:51,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,048 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 19:43:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash -281261761, now seen corresponding path program 35 times [2020-02-10 19:43:51,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864946459] [2020-02-10 19:43:51,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,188 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 19:43:51,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864946459] [2020-02-10 19:43:51,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:51,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943338703] [2020-02-10 19:43:51,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:51,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:51,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:51,190 INFO L87 Difference]: Start difference. First operand 90 states and 216 transitions. Second operand 7 states. [2020-02-10 19:43:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,232 INFO L93 Difference]: Finished difference Result 141 states and 282 transitions. [2020-02-10 19:43:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:51,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,234 INFO L225 Difference]: With dead ends: 141 [2020-02-10 19:43:51,234 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 19:43:51,234 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 19:43:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 19:43:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2020-02-10 19:43:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:43:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 220 transitions. [2020-02-10 19:43:51,239 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 220 transitions. Word has length 16 [2020-02-10 19:43:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,239 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 220 transitions. [2020-02-10 19:43:51,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 220 transitions. [2020-02-10 19:43:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:51,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,240 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 19:43:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1456765397, now seen corresponding path program 36 times [2020-02-10 19:43:51,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166664027] [2020-02-10 19:43:51,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,392 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 19:43:51,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166664027] [2020-02-10 19:43:51,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:51,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77342877] [2020-02-10 19:43:51,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:51,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:51,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:51,394 INFO L87 Difference]: Start difference. First operand 93 states and 220 transitions. Second operand 7 states. [2020-02-10 19:43:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,456 INFO L93 Difference]: Finished difference Result 130 states and 266 transitions. [2020-02-10 19:43:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:51,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,457 INFO L225 Difference]: With dead ends: 130 [2020-02-10 19:43:51,457 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 19:43:51,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 19:43:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 19:43:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2020-02-10 19:43:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:43:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-02-10 19:43:51,461 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 16 [2020-02-10 19:43:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,461 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-02-10 19:43:51,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-02-10 19:43:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:51,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,462 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 19:43:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 191866437, now seen corresponding path program 37 times [2020-02-10 19:43:51,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451709866] [2020-02-10 19:43:51,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,601 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 19:43:51,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451709866] [2020-02-10 19:43:51,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:51,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078854372] [2020-02-10 19:43:51,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:51,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:51,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:51,603 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 7 states. [2020-02-10 19:43:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,642 INFO L93 Difference]: Finished difference Result 133 states and 266 transitions. [2020-02-10 19:43:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:51,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,644 INFO L225 Difference]: With dead ends: 133 [2020-02-10 19:43:51,644 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 19:43:51,644 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 19:43:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 19:43:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2020-02-10 19:43:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:43:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 215 transitions. [2020-02-10 19:43:51,647 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 215 transitions. Word has length 16 [2020-02-10 19:43:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,647 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 215 transitions. [2020-02-10 19:43:51,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 215 transitions. [2020-02-10 19:43:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:51,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,648 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 19:43:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1160628527, now seen corresponding path program 38 times [2020-02-10 19:43:51,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391622175] [2020-02-10 19:43:51,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,810 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 19:43:51,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391622175] [2020-02-10 19:43:51,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:51,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805300285] [2020-02-10 19:43:51,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:51,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:51,815 INFO L87 Difference]: Start difference. First operand 90 states and 215 transitions. Second operand 7 states. [2020-02-10 19:43:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,882 INFO L93 Difference]: Finished difference Result 136 states and 271 transitions. [2020-02-10 19:43:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:51,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,883 INFO L225 Difference]: With dead ends: 136 [2020-02-10 19:43:51,883 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 19:43:51,884 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 19:43:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 19:43:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2020-02-10 19:43:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:43:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 213 transitions. [2020-02-10 19:43:51,887 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 213 transitions. Word has length 16 [2020-02-10 19:43:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,887 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 213 transitions. [2020-02-10 19:43:51,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 213 transitions. [2020-02-10 19:43:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:51,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,890 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 19:43:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash 936568935, now seen corresponding path program 39 times [2020-02-10 19:43:51,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29900262] [2020-02-10 19:43:51,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,053 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 19:43:52,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29900262] [2020-02-10 19:43:52,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:52,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954020395] [2020-02-10 19:43:52,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:52,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:52,055 INFO L87 Difference]: Start difference. First operand 89 states and 213 transitions. Second operand 7 states. [2020-02-10 19:43:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,105 INFO L93 Difference]: Finished difference Result 130 states and 260 transitions. [2020-02-10 19:43:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:52,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,106 INFO L225 Difference]: With dead ends: 130 [2020-02-10 19:43:52,106 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 19:43:52,107 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 19:43:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 19:43:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2020-02-10 19:43:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:43:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 214 transitions. [2020-02-10 19:43:52,110 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 214 transitions. Word has length 16 [2020-02-10 19:43:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,111 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 214 transitions. [2020-02-10 19:43:52,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 214 transitions. [2020-02-10 19:43:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:52,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,112 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 19:43:52,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1783550545, now seen corresponding path program 40 times [2020-02-10 19:43:52,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834854347] [2020-02-10 19:43:52,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,251 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 19:43:52,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834854347] [2020-02-10 19:43:52,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:52,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792213155] [2020-02-10 19:43:52,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:52,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:52,253 INFO L87 Difference]: Start difference. First operand 90 states and 214 transitions. Second operand 7 states. [2020-02-10 19:43:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,314 INFO L93 Difference]: Finished difference Result 124 states and 255 transitions. [2020-02-10 19:43:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:52,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,315 INFO L225 Difference]: With dead ends: 124 [2020-02-10 19:43:52,315 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 19:43:52,316 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 19:43:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 19:43:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2020-02-10 19:43:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:43:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 212 transitions. [2020-02-10 19:43:52,319 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 212 transitions. Word has length 16 [2020-02-10 19:43:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,320 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 212 transitions. [2020-02-10 19:43:52,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 212 transitions. [2020-02-10 19:43:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:52,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,321 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 19:43:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash -674002393, now seen corresponding path program 41 times [2020-02-10 19:43:52,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250048506] [2020-02-10 19:43:52,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,439 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 19:43:52,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250048506] [2020-02-10 19:43:52,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:52,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590740952] [2020-02-10 19:43:52,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:52,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:52,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:52,441 INFO L87 Difference]: Start difference. First operand 89 states and 212 transitions. Second operand 7 states. [2020-02-10 19:43:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,497 INFO L93 Difference]: Finished difference Result 134 states and 268 transitions. [2020-02-10 19:43:52,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:52,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,499 INFO L225 Difference]: With dead ends: 134 [2020-02-10 19:43:52,499 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 19:43:52,499 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 19:43:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 19:43:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2020-02-10 19:43:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:43:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 215 transitions. [2020-02-10 19:43:52,503 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 215 transitions. Word has length 16 [2020-02-10 19:43:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,503 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 215 transitions. [2020-02-10 19:43:52,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 215 transitions. [2020-02-10 19:43:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:52,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,505 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 19:43:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash 670167527, now seen corresponding path program 42 times [2020-02-10 19:43:52,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455243021] [2020-02-10 19:43:52,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,629 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 19:43:52,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455243021] [2020-02-10 19:43:52,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:52,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970449426] [2020-02-10 19:43:52,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:52,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:52,631 INFO L87 Difference]: Start difference. First operand 91 states and 215 transitions. Second operand 7 states. [2020-02-10 19:43:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,698 INFO L93 Difference]: Finished difference Result 125 states and 256 transitions. [2020-02-10 19:43:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:52,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,700 INFO L225 Difference]: With dead ends: 125 [2020-02-10 19:43:52,700 INFO L226 Difference]: Without dead ends: 114 [2020-02-10 19:43:52,700 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 19:43:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-02-10 19:43:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2020-02-10 19:43:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:43:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 210 transitions. [2020-02-10 19:43:52,705 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 210 transitions. Word has length 16 [2020-02-10 19:43:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,706 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 210 transitions. [2020-02-10 19:43:52,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 210 transitions. [2020-02-10 19:43:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:52,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,707 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 19:43:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,707 INFO L82 PathProgramCache]: Analyzing trace with hash 844008489, now seen corresponding path program 43 times [2020-02-10 19:43:52,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267899003] [2020-02-10 19:43:52,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,869 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 19:43:52,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267899003] [2020-02-10 19:43:52,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:52,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764897425] [2020-02-10 19:43:52,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:52,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:52,871 INFO L87 Difference]: Start difference. First operand 88 states and 210 transitions. Second operand 7 states. [2020-02-10 19:43:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,917 INFO L93 Difference]: Finished difference Result 158 states and 318 transitions. [2020-02-10 19:43:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:52,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,918 INFO L225 Difference]: With dead ends: 158 [2020-02-10 19:43:52,919 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 19:43:52,919 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 19:43:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 19:43:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2020-02-10 19:43:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 19:43:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 231 transitions. [2020-02-10 19:43:52,923 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 231 transitions. Word has length 16 [2020-02-10 19:43:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,923 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 231 transitions. [2020-02-10 19:43:52,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 231 transitions. [2020-02-10 19:43:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:52,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,924 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 19:43:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 846141909, now seen corresponding path program 44 times [2020-02-10 19:43:52,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915818256] [2020-02-10 19:43:52,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,087 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 19:43:53,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915818256] [2020-02-10 19:43:53,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:53,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37183767] [2020-02-10 19:43:53,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:53,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:53,089 INFO L87 Difference]: Start difference. First operand 98 states and 231 transitions. Second operand 7 states. [2020-02-10 19:43:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,147 INFO L93 Difference]: Finished difference Result 156 states and 310 transitions. [2020-02-10 19:43:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:53,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,149 INFO L225 Difference]: With dead ends: 156 [2020-02-10 19:43:53,149 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 19:43:53,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 19:43:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 19:43:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2020-02-10 19:43:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:43:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 218 transitions. [2020-02-10 19:43:53,153 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 218 transitions. Word has length 16 [2020-02-10 19:43:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,153 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 218 transitions. [2020-02-10 19:43:53,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 218 transitions. [2020-02-10 19:43:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:53,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,154 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 19:43:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash -436396951, now seen corresponding path program 45 times [2020-02-10 19:43:53,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983521402] [2020-02-10 19:43:53,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,296 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 19:43:53,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983521402] [2020-02-10 19:43:53,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:53,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548170895] [2020-02-10 19:43:53,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:53,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:53,298 INFO L87 Difference]: Start difference. First operand 92 states and 218 transitions. Second operand 7 states. [2020-02-10 19:43:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,333 INFO L93 Difference]: Finished difference Result 147 states and 293 transitions. [2020-02-10 19:43:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:53,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,334 INFO L225 Difference]: With dead ends: 147 [2020-02-10 19:43:53,334 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 19:43:53,335 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 19:43:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 19:43:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2020-02-10 19:43:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:43:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 222 transitions. [2020-02-10 19:43:53,338 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 222 transitions. Word has length 16 [2020-02-10 19:43:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,338 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 222 transitions. [2020-02-10 19:43:53,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 222 transitions. [2020-02-10 19:43:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:53,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,339 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 19:43:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1611900587, now seen corresponding path program 46 times [2020-02-10 19:43:53,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034148157] [2020-02-10 19:43:53,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,494 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 19:43:53,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034148157] [2020-02-10 19:43:53,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:53,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824226028] [2020-02-10 19:43:53,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:53,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:53,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:53,497 INFO L87 Difference]: Start difference. First operand 95 states and 222 transitions. Second operand 7 states. [2020-02-10 19:43:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,583 INFO L93 Difference]: Finished difference Result 136 states and 277 transitions. [2020-02-10 19:43:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:53,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,584 INFO L225 Difference]: With dead ends: 136 [2020-02-10 19:43:53,584 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 19:43:53,585 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 19:43:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 19:43:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2020-02-10 19:43:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:43:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 215 transitions. [2020-02-10 19:43:53,588 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 215 transitions. Word has length 16 [2020-02-10 19:43:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,588 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 215 transitions. [2020-02-10 19:43:53,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 215 transitions. [2020-02-10 19:43:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:53,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,589 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 19:43:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1245457199, now seen corresponding path program 47 times [2020-02-10 19:43:53,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909528022] [2020-02-10 19:43:53,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,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 19:43:53,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909528022] [2020-02-10 19:43:53,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:53,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654281078] [2020-02-10 19:43:53,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:53,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:53,711 INFO L87 Difference]: Start difference. First operand 92 states and 215 transitions. Second operand 7 states. [2020-02-10 19:43:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,774 INFO L93 Difference]: Finished difference Result 144 states and 285 transitions. [2020-02-10 19:43:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:53,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,776 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:43:53,776 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:43:53,777 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 19:43:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:43:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2020-02-10 19:43:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 19:43:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 218 transitions. [2020-02-10 19:43:53,783 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 218 transitions. Word has length 16 [2020-02-10 19:43:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,784 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 218 transitions. [2020-02-10 19:43:53,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 218 transitions. [2020-02-10 19:43:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:53,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,785 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 19:43:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash 98712721, now seen corresponding path program 48 times [2020-02-10 19:43:53,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284774374] [2020-02-10 19:43:53,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,935 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 19:43:53,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284774374] [2020-02-10 19:43:53,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:53,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627894656] [2020-02-10 19:43:53,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:53,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:53,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:53,937 INFO L87 Difference]: Start difference. First operand 94 states and 218 transitions. Second operand 7 states. [2020-02-10 19:43:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,001 INFO L93 Difference]: Finished difference Result 135 states and 273 transitions. [2020-02-10 19:43:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:54,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,003 INFO L225 Difference]: With dead ends: 135 [2020-02-10 19:43:54,003 INFO L226 Difference]: Without dead ends: 118 [2020-02-10 19:43:54,004 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 19:43:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-02-10 19:43:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2020-02-10 19:43:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:43:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 202 transitions. [2020-02-10 19:43:54,007 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 202 transitions. Word has length 16 [2020-02-10 19:43:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,008 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 202 transitions. [2020-02-10 19:43:54,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 202 transitions. [2020-02-10 19:43:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:54,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,009 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 19:43:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash -933023559, now seen corresponding path program 49 times [2020-02-10 19:43:54,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281854134] [2020-02-10 19:43:54,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,176 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 19:43:54,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281854134] [2020-02-10 19:43:54,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:54,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168403593] [2020-02-10 19:43:54,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:54,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:54,178 INFO L87 Difference]: Start difference. First operand 85 states and 202 transitions. Second operand 7 states. [2020-02-10 19:43:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,231 INFO L93 Difference]: Finished difference Result 135 states and 264 transitions. [2020-02-10 19:43:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:54,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,232 INFO L225 Difference]: With dead ends: 135 [2020-02-10 19:43:54,232 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 19:43:54,233 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 19:43:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 19:43:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2020-02-10 19:43:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:43:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-02-10 19:43:54,235 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 16 [2020-02-10 19:43:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,236 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-02-10 19:43:54,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-02-10 19:43:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:54,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,243 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 19:43:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1476458275, now seen corresponding path program 50 times [2020-02-10 19:43:54,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271035311] [2020-02-10 19:43:54,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,409 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 19:43:54,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271035311] [2020-02-10 19:43:54,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:54,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487389702] [2020-02-10 19:43:54,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:54,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:54,410 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 7 states. [2020-02-10 19:43:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,462 INFO L93 Difference]: Finished difference Result 140 states and 272 transitions. [2020-02-10 19:43:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:54,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,464 INFO L225 Difference]: With dead ends: 140 [2020-02-10 19:43:54,464 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 19:43:54,465 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 19:43:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 19:43:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2020-02-10 19:43:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:43:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 200 transitions. [2020-02-10 19:43:54,468 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 200 transitions. Word has length 16 [2020-02-10 19:43:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,468 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 200 transitions. [2020-02-10 19:43:54,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 200 transitions. [2020-02-10 19:43:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:54,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,469 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 19:43:54,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1301083935, now seen corresponding path program 51 times [2020-02-10 19:43:54,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165033756] [2020-02-10 19:43:54,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,619 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 19:43:54,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165033756] [2020-02-10 19:43:54,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:54,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28508999] [2020-02-10 19:43:54,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:54,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:54,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:54,621 INFO L87 Difference]: Start difference. First operand 85 states and 200 transitions. Second operand 7 states. [2020-02-10 19:43:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,665 INFO L93 Difference]: Finished difference Result 130 states and 253 transitions. [2020-02-10 19:43:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:54,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,667 INFO L225 Difference]: With dead ends: 130 [2020-02-10 19:43:54,667 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 19:43:54,667 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 19:43:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 19:43:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2020-02-10 19:43:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 19:43:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 201 transitions. [2020-02-10 19:43:54,671 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 201 transitions. Word has length 16 [2020-02-10 19:43:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,671 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 201 transitions. [2020-02-10 19:43:54,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 201 transitions. [2020-02-10 19:43:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:54,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,672 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 19:43:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2146901751, now seen corresponding path program 52 times [2020-02-10 19:43:54,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591883138] [2020-02-10 19:43:54,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,836 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 19:43:54,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591883138] [2020-02-10 19:43:54,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:54,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22882518] [2020-02-10 19:43:54,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:54,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:54,837 INFO L87 Difference]: Start difference. First operand 86 states and 201 transitions. Second operand 7 states. [2020-02-10 19:43:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,900 INFO L93 Difference]: Finished difference Result 131 states and 254 transitions. [2020-02-10 19:43:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:54,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,902 INFO L225 Difference]: With dead ends: 131 [2020-02-10 19:43:54,902 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 19:43:54,902 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 19:43:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 19:43:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 85. [2020-02-10 19:43:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:43:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 199 transitions. [2020-02-10 19:43:54,906 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 199 transitions. Word has length 16 [2020-02-10 19:43:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,906 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 199 transitions. [2020-02-10 19:43:54,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 199 transitions. [2020-02-10 19:43:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:54,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,907 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 19:43:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash -989832141, now seen corresponding path program 53 times [2020-02-10 19:43:54,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628500758] [2020-02-10 19:43:54,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,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 19:43:55,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628500758] [2020-02-10 19:43:55,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:55,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714221006] [2020-02-10 19:43:55,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:55,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:55,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:55,051 INFO L87 Difference]: Start difference. First operand 85 states and 199 transitions. Second operand 7 states. [2020-02-10 19:43:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,098 INFO L93 Difference]: Finished difference Result 142 states and 275 transitions. [2020-02-10 19:43:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:55,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,100 INFO L225 Difference]: With dead ends: 142 [2020-02-10 19:43:55,100 INFO L226 Difference]: Without dead ends: 130 [2020-02-10 19:43:55,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 19:43:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-02-10 19:43:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2020-02-10 19:43:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:43:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 203 transitions. [2020-02-10 19:43:55,104 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 203 transitions. Word has length 16 [2020-02-10 19:43:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,104 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 203 transitions. [2020-02-10 19:43:55,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 203 transitions. [2020-02-10 19:43:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:55,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,105 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 19:43:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2129631519, now seen corresponding path program 54 times [2020-02-10 19:43:55,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469039919] [2020-02-10 19:43:55,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,292 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 19:43:55,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469039919] [2020-02-10 19:43:55,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:55,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037734174] [2020-02-10 19:43:55,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:55,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:55,294 INFO L87 Difference]: Start difference. First operand 88 states and 203 transitions. Second operand 7 states. [2020-02-10 19:43:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,375 INFO L93 Difference]: Finished difference Result 138 states and 265 transitions. [2020-02-10 19:43:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:55,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,377 INFO L225 Difference]: With dead ends: 138 [2020-02-10 19:43:55,378 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 19:43:55,378 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 19:43:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 19:43:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 83. [2020-02-10 19:43:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:43:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 194 transitions. [2020-02-10 19:43:55,382 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 194 transitions. Word has length 16 [2020-02-10 19:43:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,382 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 194 transitions. [2020-02-10 19:43:55,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 194 transitions. [2020-02-10 19:43:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:55,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,384 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 19:43:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash -397793757, now seen corresponding path program 55 times [2020-02-10 19:43:55,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149373632] [2020-02-10 19:43:55,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,576 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 19:43:55,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149373632] [2020-02-10 19:43:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:55,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521428564] [2020-02-10 19:43:55,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:55,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:55,579 INFO L87 Difference]: Start difference. First operand 83 states and 194 transitions. Second operand 7 states. [2020-02-10 19:43:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,636 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 19:43:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:55,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,638 INFO L225 Difference]: With dead ends: 133 [2020-02-10 19:43:55,638 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 19:43:55,639 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 19:43:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 19:43:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 83. [2020-02-10 19:43:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:43:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 193 transitions. [2020-02-10 19:43:55,643 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 193 transitions. Word has length 16 [2020-02-10 19:43:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,644 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 193 transitions. [2020-02-10 19:43:55,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 193 transitions. [2020-02-10 19:43:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:55,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,645 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 19:43:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash -941228473, now seen corresponding path program 56 times [2020-02-10 19:43:55,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834631762] [2020-02-10 19:43:55,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,861 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 19:43:55,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834631762] [2020-02-10 19:43:55,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:55,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287443935] [2020-02-10 19:43:55,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:55,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:55,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:55,863 INFO L87 Difference]: Start difference. First operand 83 states and 193 transitions. Second operand 7 states. [2020-02-10 19:43:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,907 INFO L93 Difference]: Finished difference Result 138 states and 265 transitions. [2020-02-10 19:43:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:55,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,908 INFO L225 Difference]: With dead ends: 138 [2020-02-10 19:43:55,909 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 19:43:55,909 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 19:43:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 19:43:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-02-10 19:43:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:43:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 188 transitions. [2020-02-10 19:43:55,912 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 188 transitions. Word has length 16 [2020-02-10 19:43:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,913 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 188 transitions. [2020-02-10 19:43:55,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 188 transitions. [2020-02-10 19:43:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:55,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,914 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 19:43:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1887198753, now seen corresponding path program 57 times [2020-02-10 19:43:55,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223359284] [2020-02-10 19:43:55,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,063 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 19:43:56,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223359284] [2020-02-10 19:43:56,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:56,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168639058] [2020-02-10 19:43:56,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:56,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:56,066 INFO L87 Difference]: Start difference. First operand 81 states and 188 transitions. Second operand 7 states. [2020-02-10 19:43:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,110 INFO L93 Difference]: Finished difference Result 128 states and 247 transitions. [2020-02-10 19:43:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:56,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,111 INFO L225 Difference]: With dead ends: 128 [2020-02-10 19:43:56,112 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 19:43:56,112 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 19:43:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 19:43:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2020-02-10 19:43:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 19:43:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. [2020-02-10 19:43:56,115 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 189 transitions. Word has length 16 [2020-02-10 19:43:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,115 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 189 transitions. [2020-02-10 19:43:56,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 189 transitions. [2020-02-10 19:43:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:56,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,116 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 19:43:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1552461889, now seen corresponding path program 58 times [2020-02-10 19:43:56,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450369794] [2020-02-10 19:43:56,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,252 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 19:43:56,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450369794] [2020-02-10 19:43:56,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:56,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962447992] [2020-02-10 19:43:56,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:56,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:56,254 INFO L87 Difference]: Start difference. First operand 82 states and 189 transitions. Second operand 7 states. [2020-02-10 19:43:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,314 INFO L93 Difference]: Finished difference Result 123 states and 244 transitions. [2020-02-10 19:43:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:56,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,316 INFO L225 Difference]: With dead ends: 123 [2020-02-10 19:43:56,316 INFO L226 Difference]: Without dead ends: 113 [2020-02-10 19:43:56,316 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 19:43:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-02-10 19:43:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2020-02-10 19:43:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:43:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 187 transitions. [2020-02-10 19:43:56,319 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 187 transitions. Word has length 16 [2020-02-10 19:43:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,319 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 187 transitions. [2020-02-10 19:43:56,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 187 transitions. [2020-02-10 19:43:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:56,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,320 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 19:43:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1685930971, now seen corresponding path program 59 times [2020-02-10 19:43:56,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048747576] [2020-02-10 19:43:56,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,462 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 19:43:56,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048747576] [2020-02-10 19:43:56,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:56,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781805623] [2020-02-10 19:43:56,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:56,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:56,464 INFO L87 Difference]: Start difference. First operand 81 states and 187 transitions. Second operand 7 states. [2020-02-10 19:43:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,502 INFO L93 Difference]: Finished difference Result 136 states and 263 transitions. [2020-02-10 19:43:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:56,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,503 INFO L225 Difference]: With dead ends: 136 [2020-02-10 19:43:56,503 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 19:43:56,503 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 19:43:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 19:43:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 85. [2020-02-10 19:43:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:43:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 193 transitions. [2020-02-10 19:43:56,506 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 193 transitions. Word has length 16 [2020-02-10 19:43:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,506 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 193 transitions. [2020-02-10 19:43:56,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 193 transitions. [2020-02-10 19:43:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:56,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,507 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 19:43:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash -760187613, now seen corresponding path program 60 times [2020-02-10 19:43:56,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171944678] [2020-02-10 19:43:56,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,622 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 19:43:56,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171944678] [2020-02-10 19:43:56,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:56,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394164184] [2020-02-10 19:43:56,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:56,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:56,623 INFO L87 Difference]: Start difference. First operand 85 states and 193 transitions. Second operand 7 states. [2020-02-10 19:43:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,705 INFO L93 Difference]: Finished difference Result 126 states and 248 transitions. [2020-02-10 19:43:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:56,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,707 INFO L225 Difference]: With dead ends: 126 [2020-02-10 19:43:56,707 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 19:43:56,708 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 19:43:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 19:43:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2020-02-10 19:43:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 19:43:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-02-10 19:43:56,711 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 16 [2020-02-10 19:43:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,711 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-02-10 19:43:56,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-02-10 19:43:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:56,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,712 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 19:43:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1920797981, now seen corresponding path program 61 times [2020-02-10 19:43:56,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976165101] [2020-02-10 19:43:56,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,878 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 19:43:56,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976165101] [2020-02-10 19:43:56,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:56,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333684093] [2020-02-10 19:43:56,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:56,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:56,879 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 7 states. [2020-02-10 19:43:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,943 INFO L93 Difference]: Finished difference Result 120 states and 230 transitions. [2020-02-10 19:43:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:56,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,945 INFO L225 Difference]: With dead ends: 120 [2020-02-10 19:43:56,945 INFO L226 Difference]: Without dead ends: 113 [2020-02-10 19:43:56,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 19:43:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-02-10 19:43:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2020-02-10 19:43:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:43:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 186 transitions. [2020-02-10 19:43:56,948 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 186 transitions. Word has length 16 [2020-02-10 19:43:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,948 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 186 transitions. [2020-02-10 19:43:56,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 186 transitions. [2020-02-10 19:43:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:56,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,949 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 19:43:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1073816371, now seen corresponding path program 62 times [2020-02-10 19:43:56,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076850632] [2020-02-10 19:43:56,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,112 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 19:43:57,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076850632] [2020-02-10 19:43:57,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:57,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766782708] [2020-02-10 19:43:57,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:57,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:57,113 INFO L87 Difference]: Start difference. First operand 81 states and 186 transitions. Second operand 7 states. [2020-02-10 19:43:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,175 INFO L93 Difference]: Finished difference Result 121 states and 231 transitions. [2020-02-10 19:43:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:57,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,176 INFO L225 Difference]: With dead ends: 121 [2020-02-10 19:43:57,177 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 19:43:57,177 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 19:43:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 19:43:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2020-02-10 19:43:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-02-10 19:43:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 184 transitions. [2020-02-10 19:43:57,179 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 184 transitions. Word has length 16 [2020-02-10 19:43:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,179 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 184 transitions. [2020-02-10 19:43:57,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 184 transitions. [2020-02-10 19:43:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:57,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,180 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 19:43:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1349343175, now seen corresponding path program 63 times [2020-02-10 19:43:57,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44822162] [2020-02-10 19:43:57,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,344 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 19:43:57,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44822162] [2020-02-10 19:43:57,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:57,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312142366] [2020-02-10 19:43:57,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:57,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:57,346 INFO L87 Difference]: Start difference. First operand 80 states and 184 transitions. Second operand 7 states. [2020-02-10 19:43:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,390 INFO L93 Difference]: Finished difference Result 119 states and 228 transitions. [2020-02-10 19:43:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:57,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,392 INFO L225 Difference]: With dead ends: 119 [2020-02-10 19:43:57,392 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 19:43:57,392 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 19:43:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 19:43:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2020-02-10 19:43:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:43:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 185 transitions. [2020-02-10 19:43:57,395 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 185 transitions. Word has length 16 [2020-02-10 19:43:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,395 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 185 transitions. [2020-02-10 19:43:57,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 185 transitions. [2020-02-10 19:43:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:57,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,396 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 19:43:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2090317467, now seen corresponding path program 64 times [2020-02-10 19:43:57,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356755580] [2020-02-10 19:43:57,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,565 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 19:43:57,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356755580] [2020-02-10 19:43:57,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:57,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979021367] [2020-02-10 19:43:57,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:57,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:57,567 INFO L87 Difference]: Start difference. First operand 81 states and 185 transitions. Second operand 7 states. [2020-02-10 19:43:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,626 INFO L93 Difference]: Finished difference Result 114 states and 225 transitions. [2020-02-10 19:43:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:57,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,628 INFO L225 Difference]: With dead ends: 114 [2020-02-10 19:43:57,628 INFO L226 Difference]: Without dead ends: 104 [2020-02-10 19:43:57,628 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 19:43:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-02-10 19:43:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 80. [2020-02-10 19:43:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-02-10 19:43:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 183 transitions. [2020-02-10 19:43:57,633 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 183 transitions. Word has length 16 [2020-02-10 19:43:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,633 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 183 transitions. [2020-02-10 19:43:57,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 183 transitions. [2020-02-10 19:43:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:57,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,634 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 19:43:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1818518869, now seen corresponding path program 65 times [2020-02-10 19:43:57,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957763101] [2020-02-10 19:43:57,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,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 19:43:57,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957763101] [2020-02-10 19:43:57,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:57,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558734204] [2020-02-10 19:43:57,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:57,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:57,814 INFO L87 Difference]: Start difference. First operand 80 states and 183 transitions. Second operand 7 states. [2020-02-10 19:43:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,879 INFO L93 Difference]: Finished difference Result 114 states and 226 transitions. [2020-02-10 19:43:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:57,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,881 INFO L225 Difference]: With dead ends: 114 [2020-02-10 19:43:57,881 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 19:43:57,881 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 19:43:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 19:43:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-02-10 19:43:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 19:43:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 186 transitions. [2020-02-10 19:43:57,885 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 186 transitions. Word has length 16 [2020-02-10 19:43:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,885 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 186 transitions. [2020-02-10 19:43:57,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 186 transitions. [2020-02-10 19:43:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:57,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,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 19:43:57,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 19:43:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 3293241, now seen corresponding path program 66 times [2020-02-10 19:43:57,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90874854] [2020-02-10 19:43:57,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,080 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 19:43:58,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90874854] [2020-02-10 19:43:58,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:58,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631996082] [2020-02-10 19:43:58,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:58,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:58,083 INFO L87 Difference]: Start difference. First operand 82 states and 186 transitions. Second operand 7 states. [2020-02-10 19:43:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,148 INFO L93 Difference]: Finished difference Result 105 states and 215 transitions. [2020-02-10 19:43:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:58,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:58,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,149 INFO L225 Difference]: With dead ends: 105 [2020-02-10 19:43:58,149 INFO L226 Difference]: Without dead ends: 93 [2020-02-10 19:43:58,149 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 19:43:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-02-10 19:43:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2020-02-10 19:43:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 19:43:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 181 transitions. [2020-02-10 19:43:58,152 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 181 transitions. Word has length 16 [2020-02-10 19:43:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,152 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 181 transitions. [2020-02-10 19:43:58,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 181 transitions. [2020-02-10 19:43:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:58,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,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 19:43:58,153 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 19:43:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1694194197, now seen corresponding path program 67 times [2020-02-10 19:43:58,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172622713] [2020-02-10 19:43:58,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,285 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 19:43:58,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172622713] [2020-02-10 19:43:58,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:58,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447259718] [2020-02-10 19:43:58,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:58,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:58,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:58,287 INFO L87 Difference]: Start difference. First operand 79 states and 181 transitions. Second operand 7 states. [2020-02-10 19:43:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,328 INFO L93 Difference]: Finished difference Result 137 states and 267 transitions. [2020-02-10 19:43:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:58,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,329 INFO L225 Difference]: With dead ends: 137 [2020-02-10 19:43:58,330 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 19:43:58,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 19:43:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 19:43:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2020-02-10 19:43:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:43:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 195 transitions. [2020-02-10 19:43:58,333 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 195 transitions. Word has length 16 [2020-02-10 19:43:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,333 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 195 transitions. [2020-02-10 19:43:58,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 195 transitions. [2020-02-10 19:43:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:58,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,334 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 19:43:58,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 518690561, now seen corresponding path program 68 times [2020-02-10 19:43:58,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170389656] [2020-02-10 19:43:58,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,460 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 19:43:58,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170389656] [2020-02-10 19:43:58,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:58,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209251131] [2020-02-10 19:43:58,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:58,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:58,462 INFO L87 Difference]: Start difference. First operand 85 states and 195 transitions. Second operand 7 states. [2020-02-10 19:43:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,522 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 19:43:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:58,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,523 INFO L225 Difference]: With dead ends: 133 [2020-02-10 19:43:58,523 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 19:43:58,524 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 19:43:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 19:43:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2020-02-10 19:43:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 19:43:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 188 transitions. [2020-02-10 19:43:58,528 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 188 transitions. Word has length 16 [2020-02-10 19:43:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,529 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 188 transitions. [2020-02-10 19:43:58,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 188 transitions. [2020-02-10 19:43:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:58,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,529 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,530 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 19:43:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1959172537, now seen corresponding path program 69 times [2020-02-10 19:43:58,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130010109] [2020-02-10 19:43:58,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,662 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 19:43:58,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130010109] [2020-02-10 19:43:58,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:58,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839972413] [2020-02-10 19:43:58,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:58,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:58,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:58,664 INFO L87 Difference]: Start difference. First operand 82 states and 188 transitions. Second operand 7 states. [2020-02-10 19:43:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,712 INFO L93 Difference]: Finished difference Result 129 states and 249 transitions. [2020-02-10 19:43:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:58,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,714 INFO L225 Difference]: With dead ends: 129 [2020-02-10 19:43:58,714 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 19:43:58,714 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 19:43:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 19:43:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2020-02-10 19:43:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 19:43:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 194 transitions. [2020-02-10 19:43:58,717 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 194 transitions. Word has length 16 [2020-02-10 19:43:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,717 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 194 transitions. [2020-02-10 19:43:58,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 194 transitions. [2020-02-10 19:43:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:58,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,718 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 19:43:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1440320653, now seen corresponding path program 70 times [2020-02-10 19:43:58,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362822266] [2020-02-10 19:43:58,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,861 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 19:43:58,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362822266] [2020-02-10 19:43:58,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:58,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904593772] [2020-02-10 19:43:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:58,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:58,863 INFO L87 Difference]: Start difference. First operand 86 states and 194 transitions. Second operand 7 states. [2020-02-10 19:43:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,927 INFO L93 Difference]: Finished difference Result 119 states and 234 transitions. [2020-02-10 19:43:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:58,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,929 INFO L225 Difference]: With dead ends: 119 [2020-02-10 19:43:58,929 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 19:43:58,929 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 19:43:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 19:43:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-02-10 19:43:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 19:43:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 185 transitions. [2020-02-10 19:43:58,933 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 185 transitions. Word has length 16 [2020-02-10 19:43:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,933 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 185 transitions. [2020-02-10 19:43:58,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 185 transitions. [2020-02-10 19:43:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:58,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,934 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 19:43:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -568756211, now seen corresponding path program 71 times [2020-02-10 19:43:58,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783171022] [2020-02-10 19:43:58,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,094 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 19:43:59,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783171022] [2020-02-10 19:43:59,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:59,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002060310] [2020-02-10 19:43:59,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:59,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:59,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:59,095 INFO L87 Difference]: Start difference. First operand 82 states and 185 transitions. Second operand 7 states. [2020-02-10 19:43:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,144 INFO L93 Difference]: Finished difference Result 116 states and 228 transitions. [2020-02-10 19:43:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:59,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,146 INFO L225 Difference]: With dead ends: 116 [2020-02-10 19:43:59,146 INFO L226 Difference]: Without dead ends: 108 [2020-02-10 19:43:59,146 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 19:43:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-02-10 19:43:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2020-02-10 19:43:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-02-10 19:43:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 188 transitions. [2020-02-10 19:43:59,148 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 188 transitions. Word has length 16 [2020-02-10 19:43:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,149 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 188 transitions. [2020-02-10 19:43:59,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 188 transitions. [2020-02-10 19:43:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:59,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,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 19:43:59,152 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 19:43:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash -568161565, now seen corresponding path program 72 times [2020-02-10 19:43:59,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162768438] [2020-02-10 19:43:59,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,273 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 19:43:59,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162768438] [2020-02-10 19:43:59,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:59,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906643060] [2020-02-10 19:43:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:59,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:59,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:59,274 INFO L87 Difference]: Start difference. First operand 84 states and 188 transitions. Second operand 7 states. [2020-02-10 19:43:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,318 INFO L93 Difference]: Finished difference Result 107 states and 217 transitions. [2020-02-10 19:43:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:59,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,320 INFO L225 Difference]: With dead ends: 107 [2020-02-10 19:43:59,320 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 19:43:59,320 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 19:43:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 19:43:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2020-02-10 19:43:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 19:43:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 176 transitions. [2020-02-10 19:43:59,323 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 176 transitions. Word has length 16 [2020-02-10 19:43:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,324 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 176 transitions. [2020-02-10 19:43:59,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 176 transitions. [2020-02-10 19:43:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:59,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:59,325 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 19:43:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash 577387645, now seen corresponding path program 73 times [2020-02-10 19:43:59,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482441932] [2020-02-10 19:43:59,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,467 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 19:43:59,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482441932] [2020-02-10 19:43:59,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:59,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512798312] [2020-02-10 19:43:59,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:59,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:59,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:59,469 INFO L87 Difference]: Start difference. First operand 77 states and 176 transitions. Second operand 7 states. [2020-02-10 19:43:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,511 INFO L93 Difference]: Finished difference Result 119 states and 225 transitions. [2020-02-10 19:43:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:59,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,512 INFO L225 Difference]: With dead ends: 119 [2020-02-10 19:43:59,512 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 19:43:59,512 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 19:43:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 19:43:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2020-02-10 19:43:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 19:43:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-02-10 19:43:59,515 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 16 [2020-02-10 19:43:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,515 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-02-10 19:43:59,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-02-10 19:43:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:59,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,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 19:43:59,516 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 19:43:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash -775107319, now seen corresponding path program 74 times [2020-02-10 19:43:59,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992305713] [2020-02-10 19:43:59,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,648 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 19:43:59,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992305713] [2020-02-10 19:43:59,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:59,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93121900] [2020-02-10 19:43:59,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:59,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:59,650 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 7 states. [2020-02-10 19:43:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,718 INFO L93 Difference]: Finished difference Result 122 states and 230 transitions. [2020-02-10 19:43:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:59,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,719 INFO L225 Difference]: With dead ends: 122 [2020-02-10 19:43:59,719 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 19:43:59,720 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 19:43:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 19:43:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2020-02-10 19:43:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 19:43:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 175 transitions. [2020-02-10 19:43:59,722 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 175 transitions. Word has length 16 [2020-02-10 19:43:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,722 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 175 transitions. [2020-02-10 19:43:59,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 175 transitions. [2020-02-10 19:43:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:59,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:59,723 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 19:43:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1322090143, now seen corresponding path program 75 times [2020-02-10 19:43:59,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039634706] [2020-02-10 19:43:59,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,878 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 19:43:59,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039634706] [2020-02-10 19:43:59,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:43:59,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850575140] [2020-02-10 19:43:59,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:43:59,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:43:59,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:59,879 INFO L87 Difference]: Start difference. First operand 77 states and 175 transitions. Second operand 7 states. [2020-02-10 19:43:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,926 INFO L93 Difference]: Finished difference Result 117 states and 220 transitions. [2020-02-10 19:43:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:43:59,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:43:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,927 INFO L225 Difference]: With dead ends: 117 [2020-02-10 19:43:59,928 INFO L226 Difference]: Without dead ends: 110 [2020-02-10 19:43:59,928 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 19:43:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-02-10 19:43:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2020-02-10 19:43:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 19:43:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 176 transitions. [2020-02-10 19:43:59,929 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 176 transitions. Word has length 16 [2020-02-10 19:43:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,930 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 176 transitions. [2020-02-10 19:43:59,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:43:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 176 transitions. [2020-02-10 19:43:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:43:59,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:59,930 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 19:43:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2125895543, now seen corresponding path program 76 times [2020-02-10 19:43:59,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711967800] [2020-02-10 19:43:59,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,067 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 19:44:00,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711967800] [2020-02-10 19:44:00,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:00,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370489671] [2020-02-10 19:44:00,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:00,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:00,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:00,070 INFO L87 Difference]: Start difference. First operand 78 states and 176 transitions. Second operand 7 states. [2020-02-10 19:44:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,160 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2020-02-10 19:44:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:00,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,162 INFO L225 Difference]: With dead ends: 118 [2020-02-10 19:44:00,162 INFO L226 Difference]: Without dead ends: 109 [2020-02-10 19:44:00,163 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 19:44:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-02-10 19:44:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 77. [2020-02-10 19:44:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 19:44:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 174 transitions. [2020-02-10 19:44:00,166 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 174 transitions. Word has length 16 [2020-02-10 19:44:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,166 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 174 transitions. [2020-02-10 19:44:00,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 174 transitions. [2020-02-10 19:44:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:00,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,168 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 19:44:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -288481185, now seen corresponding path program 77 times [2020-02-10 19:44:00,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489541789] [2020-02-10 19:44:00,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,303 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 19:44:00,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489541789] [2020-02-10 19:44:00,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:00,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873178148] [2020-02-10 19:44:00,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:00,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:00,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:00,305 INFO L87 Difference]: Start difference. First operand 77 states and 174 transitions. Second operand 7 states. [2020-02-10 19:44:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,375 INFO L93 Difference]: Finished difference Result 124 states and 234 transitions. [2020-02-10 19:44:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:00,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,377 INFO L225 Difference]: With dead ends: 124 [2020-02-10 19:44:00,377 INFO L226 Difference]: Without dead ends: 114 [2020-02-10 19:44:00,378 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 19:44:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-02-10 19:44:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 79. [2020-02-10 19:44:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 19:44:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 177 transitions. [2020-02-10 19:44:00,381 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 177 transitions. Word has length 16 [2020-02-10 19:44:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,381 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 177 transitions. [2020-02-10 19:44:00,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 177 transitions. [2020-02-10 19:44:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:00,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,382 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 19:44:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1055688735, now seen corresponding path program 78 times [2020-02-10 19:44:00,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392936788] [2020-02-10 19:44:00,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,527 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 19:44:00,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392936788] [2020-02-10 19:44:00,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:00,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136830134] [2020-02-10 19:44:00,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:00,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:00,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:00,529 INFO L87 Difference]: Start difference. First operand 79 states and 177 transitions. Second operand 7 states. [2020-02-10 19:44:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,589 INFO L93 Difference]: Finished difference Result 122 states and 228 transitions. [2020-02-10 19:44:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:00,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,590 INFO L225 Difference]: With dead ends: 122 [2020-02-10 19:44:00,590 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 19:44:00,590 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 19:44:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 19:44:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2020-02-10 19:44:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 19:44:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 172 transitions. [2020-02-10 19:44:00,593 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 172 transitions. Word has length 16 [2020-02-10 19:44:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,593 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 172 transitions. [2020-02-10 19:44:00,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 172 transitions. [2020-02-10 19:44:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:00,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,594 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 19:44:00,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1112617447, now seen corresponding path program 79 times [2020-02-10 19:44:00,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540376651] [2020-02-10 19:44:00,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,733 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 19:44:00,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540376651] [2020-02-10 19:44:00,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:00,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278315694] [2020-02-10 19:44:00,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:00,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:00,735 INFO L87 Difference]: Start difference. First operand 76 states and 172 transitions. Second operand 7 states. [2020-02-10 19:44:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,778 INFO L93 Difference]: Finished difference Result 119 states and 224 transitions. [2020-02-10 19:44:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:00,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,779 INFO L225 Difference]: With dead ends: 119 [2020-02-10 19:44:00,779 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 19:44:00,780 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 19:44:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 19:44:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2020-02-10 19:44:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 19:44:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 171 transitions. [2020-02-10 19:44:00,782 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 171 transitions. Word has length 16 [2020-02-10 19:44:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,782 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 171 transitions. [2020-02-10 19:44:00,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 171 transitions. [2020-02-10 19:44:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:00,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,783 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 19:44:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,783 INFO L82 PathProgramCache]: Analyzing trace with hash -239877517, now seen corresponding path program 80 times [2020-02-10 19:44:00,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897461216] [2020-02-10 19:44:00,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,912 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 19:44:00,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897461216] [2020-02-10 19:44:00,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:00,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6954357] [2020-02-10 19:44:00,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:00,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:00,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:00,913 INFO L87 Difference]: Start difference. First operand 76 states and 171 transitions. Second operand 7 states. [2020-02-10 19:44:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,965 INFO L93 Difference]: Finished difference Result 122 states and 229 transitions. [2020-02-10 19:44:00,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:00,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,966 INFO L225 Difference]: With dead ends: 122 [2020-02-10 19:44:00,966 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 19:44:00,967 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 19:44:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 19:44:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2020-02-10 19:44:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 19:44:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 169 transitions. [2020-02-10 19:44:00,970 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 169 transitions. Word has length 16 [2020-02-10 19:44:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,970 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 169 transitions. [2020-02-10 19:44:00,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 169 transitions. [2020-02-10 19:44:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:00,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,971 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 19:44:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1866192545, now seen corresponding path program 81 times [2020-02-10 19:44:00,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884892795] [2020-02-10 19:44:00,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,112 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 19:44:01,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884892795] [2020-02-10 19:44:01,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:01,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360134820] [2020-02-10 19:44:01,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:01,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:01,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:01,114 INFO L87 Difference]: Start difference. First operand 75 states and 169 transitions. Second operand 7 states. [2020-02-10 19:44:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,160 INFO L93 Difference]: Finished difference Result 117 states and 220 transitions. [2020-02-10 19:44:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:01,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,161 INFO L225 Difference]: With dead ends: 117 [2020-02-10 19:44:01,162 INFO L226 Difference]: Without dead ends: 110 [2020-02-10 19:44:01,162 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 19:44:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-02-10 19:44:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2020-02-10 19:44:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 19:44:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 170 transitions. [2020-02-10 19:44:01,166 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 170 transitions. Word has length 16 [2020-02-10 19:44:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,166 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 170 transitions. [2020-02-10 19:44:01,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 170 transitions. [2020-02-10 19:44:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:01,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,166 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 19:44:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1573468097, now seen corresponding path program 82 times [2020-02-10 19:44:01,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405976848] [2020-02-10 19:44:01,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,303 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 19:44:01,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405976848] [2020-02-10 19:44:01,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:01,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057614098] [2020-02-10 19:44:01,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:01,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:01,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:01,305 INFO L87 Difference]: Start difference. First operand 76 states and 170 transitions. Second operand 7 states. [2020-02-10 19:44:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,357 INFO L93 Difference]: Finished difference Result 112 states and 217 transitions. [2020-02-10 19:44:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:01,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,359 INFO L225 Difference]: With dead ends: 112 [2020-02-10 19:44:01,359 INFO L226 Difference]: Without dead ends: 102 [2020-02-10 19:44:01,359 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 19:44:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-02-10 19:44:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2020-02-10 19:44:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 19:44:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-02-10 19:44:01,363 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 16 [2020-02-10 19:44:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,363 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-02-10 19:44:01,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-02-10 19:44:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:01,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,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 19:44:01,364 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 19:44:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash -984580015, now seen corresponding path program 83 times [2020-02-10 19:44:01,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100786119] [2020-02-10 19:44:01,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,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 19:44:01,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100786119] [2020-02-10 19:44:01,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:01,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951387982] [2020-02-10 19:44:01,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:01,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:01,492 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 7 states. [2020-02-10 19:44:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,548 INFO L93 Difference]: Finished difference Result 122 states and 231 transitions. [2020-02-10 19:44:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:01,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,550 INFO L225 Difference]: With dead ends: 122 [2020-02-10 19:44:01,550 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 19:44:01,550 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 19:44:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 19:44:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2020-02-10 19:44:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 19:44:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 173 transitions. [2020-02-10 19:44:01,553 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 173 transitions. Word has length 16 [2020-02-10 19:44:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,553 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 173 transitions. [2020-02-10 19:44:01,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 173 transitions. [2020-02-10 19:44:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:01,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,554 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 19:44:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash -116381337, now seen corresponding path program 84 times [2020-02-10 19:44:01,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166184233] [2020-02-10 19:44:01,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,702 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 19:44:01,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166184233] [2020-02-10 19:44:01,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:01,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143048061] [2020-02-10 19:44:01,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:01,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:01,704 INFO L87 Difference]: Start difference. First operand 78 states and 173 transitions. Second operand 7 states. [2020-02-10 19:44:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,763 INFO L93 Difference]: Finished difference Result 114 states and 220 transitions. [2020-02-10 19:44:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:01,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,764 INFO L225 Difference]: With dead ends: 114 [2020-02-10 19:44:01,765 INFO L226 Difference]: Without dead ends: 101 [2020-02-10 19:44:01,765 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 19:44:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-02-10 19:44:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2020-02-10 19:44:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 19:44:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 166 transitions. [2020-02-10 19:44:01,768 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 166 transitions. Word has length 16 [2020-02-10 19:44:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,768 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 166 transitions. [2020-02-10 19:44:01,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 166 transitions. [2020-02-10 19:44:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:01,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,768 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,768 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 19:44:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash -826706393, now seen corresponding path program 85 times [2020-02-10 19:44:01,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45249076] [2020-02-10 19:44:01,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,943 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 19:44:01,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45249076] [2020-02-10 19:44:01,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:01,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934466965] [2020-02-10 19:44:01,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:01,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:01,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:01,945 INFO L87 Difference]: Start difference. First operand 74 states and 166 transitions. Second operand 7 states. [2020-02-10 19:44:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,989 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2020-02-10 19:44:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:01,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,990 INFO L225 Difference]: With dead ends: 111 [2020-02-10 19:44:01,990 INFO L226 Difference]: Without dead ends: 104 [2020-02-10 19:44:01,991 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 19:44:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-02-10 19:44:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2020-02-10 19:44:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 19:44:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 165 transitions. [2020-02-10 19:44:01,993 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 165 transitions. Word has length 16 [2020-02-10 19:44:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,993 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 165 transitions. [2020-02-10 19:44:01,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 165 transitions. [2020-02-10 19:44:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:01,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,994 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 19:44:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,994 INFO L82 PathProgramCache]: Analyzing trace with hash 20275217, now seen corresponding path program 86 times [2020-02-10 19:44:01,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031059419] [2020-02-10 19:44:01,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,165 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 19:44:02,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031059419] [2020-02-10 19:44:02,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:02,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966557914] [2020-02-10 19:44:02,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:02,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:02,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:02,167 INFO L87 Difference]: Start difference. First operand 74 states and 165 transitions. Second operand 7 states. [2020-02-10 19:44:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,226 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2020-02-10 19:44:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:02,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,228 INFO L225 Difference]: With dead ends: 112 [2020-02-10 19:44:02,228 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 19:44:02,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 19:44:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 19:44:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2020-02-10 19:44:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 19:44:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 163 transitions. [2020-02-10 19:44:02,231 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 163 transitions. Word has length 16 [2020-02-10 19:44:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,231 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 163 transitions. [2020-02-10 19:44:02,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 163 transitions. [2020-02-10 19:44:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:02,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,232 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 19:44:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash -255251587, now seen corresponding path program 87 times [2020-02-10 19:44:02,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450558745] [2020-02-10 19:44:02,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,388 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 19:44:02,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450558745] [2020-02-10 19:44:02,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:02,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974993650] [2020-02-10 19:44:02,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:02,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:02,390 INFO L87 Difference]: Start difference. First operand 73 states and 163 transitions. Second operand 7 states. [2020-02-10 19:44:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,434 INFO L93 Difference]: Finished difference Result 110 states and 204 transitions. [2020-02-10 19:44:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:02,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,436 INFO L225 Difference]: With dead ends: 110 [2020-02-10 19:44:02,436 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 19:44:02,436 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 19:44:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 19:44:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2020-02-10 19:44:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 19:44:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 161 transitions. [2020-02-10 19:44:02,439 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 161 transitions. Word has length 16 [2020-02-10 19:44:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,439 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 161 transitions. [2020-02-10 19:44:02,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 161 transitions. [2020-02-10 19:44:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:02,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,440 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 19:44:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1110558241, now seen corresponding path program 88 times [2020-02-10 19:44:02,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134034519] [2020-02-10 19:44:02,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,649 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 19:44:02,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134034519] [2020-02-10 19:44:02,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:02,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460912333] [2020-02-10 19:44:02,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:02,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:02,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:02,651 INFO L87 Difference]: Start difference. First operand 72 states and 161 transitions. Second operand 7 states. [2020-02-10 19:44:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,722 INFO L93 Difference]: Finished difference Result 105 states and 201 transitions. [2020-02-10 19:44:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:02,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,724 INFO L225 Difference]: With dead ends: 105 [2020-02-10 19:44:02,725 INFO L226 Difference]: Without dead ends: 95 [2020-02-10 19:44:02,725 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 19:44:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-02-10 19:44:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2020-02-10 19:44:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 19:44:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 159 transitions. [2020-02-10 19:44:02,728 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 159 transitions. Word has length 16 [2020-02-10 19:44:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,729 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 159 transitions. [2020-02-10 19:44:02,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 159 transitions. [2020-02-10 19:44:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:02,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,730 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 19:44:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash -724427281, now seen corresponding path program 89 times [2020-02-10 19:44:02,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83443580] [2020-02-10 19:44:02,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,920 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 19:44:02,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83443580] [2020-02-10 19:44:02,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:02,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996939384] [2020-02-10 19:44:02,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:02,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:02,923 INFO L87 Difference]: Start difference. First operand 71 states and 159 transitions. Second operand 7 states. [2020-02-10 19:44:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,999 INFO L93 Difference]: Finished difference Result 105 states and 202 transitions. [2020-02-10 19:44:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:03,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,001 INFO L225 Difference]: With dead ends: 105 [2020-02-10 19:44:03,001 INFO L226 Difference]: Without dead ends: 97 [2020-02-10 19:44:03,002 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 19:44:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-02-10 19:44:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2020-02-10 19:44:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 19:44:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 162 transitions. [2020-02-10 19:44:03,005 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 162 transitions. Word has length 16 [2020-02-10 19:44:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,005 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 162 transitions. [2020-02-10 19:44:03,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 162 transitions. [2020-02-10 19:44:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:03,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,007 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 19:44:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1097384829, now seen corresponding path program 90 times [2020-02-10 19:44:03,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040675551] [2020-02-10 19:44:03,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,165 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 19:44:03,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040675551] [2020-02-10 19:44:03,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:03,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86495749] [2020-02-10 19:44:03,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:03,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:03,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:03,167 INFO L87 Difference]: Start difference. First operand 73 states and 162 transitions. Second operand 7 states. [2020-02-10 19:44:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,219 INFO L93 Difference]: Finished difference Result 96 states and 191 transitions. [2020-02-10 19:44:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:03,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,220 INFO L225 Difference]: With dead ends: 96 [2020-02-10 19:44:03,220 INFO L226 Difference]: Without dead ends: 84 [2020-02-10 19:44:03,221 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 19:44:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-02-10 19:44:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2020-02-10 19:44:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-02-10 19:44:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 157 transitions. [2020-02-10 19:44:03,223 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 157 transitions. Word has length 16 [2020-02-10 19:44:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,223 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 157 transitions. [2020-02-10 19:44:03,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 157 transitions. [2020-02-10 19:44:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:03,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,224 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 19:44:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1899422143, now seen corresponding path program 91 times [2020-02-10 19:44:03,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395248758] [2020-02-10 19:44:03,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,343 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 19:44:03,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395248758] [2020-02-10 19:44:03,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:03,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876764230] [2020-02-10 19:44:03,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:03,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:03,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:03,345 INFO L87 Difference]: Start difference. First operand 70 states and 157 transitions. Second operand 7 states. [2020-02-10 19:44:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,397 INFO L93 Difference]: Finished difference Result 112 states and 221 transitions. [2020-02-10 19:44:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:03,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,398 INFO L225 Difference]: With dead ends: 112 [2020-02-10 19:44:03,398 INFO L226 Difference]: Without dead ends: 102 [2020-02-10 19:44:03,398 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 19:44:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-02-10 19:44:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2020-02-10 19:44:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 19:44:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 167 transitions. [2020-02-10 19:44:03,400 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 167 transitions. Word has length 16 [2020-02-10 19:44:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,400 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 167 transitions. [2020-02-10 19:44:03,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2020-02-10 19:44:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:03,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,401 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 19:44:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash -555252223, now seen corresponding path program 92 times [2020-02-10 19:44:03,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510718982] [2020-02-10 19:44:03,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,507 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 19:44:03,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510718982] [2020-02-10 19:44:03,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:03,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918276368] [2020-02-10 19:44:03,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:03,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:03,509 INFO L87 Difference]: Start difference. First operand 74 states and 167 transitions. Second operand 7 states. [2020-02-10 19:44:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,569 INFO L93 Difference]: Finished difference Result 110 states and 215 transitions. [2020-02-10 19:44:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:03,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,570 INFO L225 Difference]: With dead ends: 110 [2020-02-10 19:44:03,570 INFO L226 Difference]: Without dead ends: 100 [2020-02-10 19:44:03,571 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 19:44:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-02-10 19:44:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2020-02-10 19:44:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 19:44:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 162 transitions. [2020-02-10 19:44:03,575 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 162 transitions. Word has length 16 [2020-02-10 19:44:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,575 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 162 transitions. [2020-02-10 19:44:03,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 162 transitions. [2020-02-10 19:44:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:03,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,576 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 19:44:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1257821581, now seen corresponding path program 93 times [2020-02-10 19:44:03,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448511214] [2020-02-10 19:44:03,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,710 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 19:44:03,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448511214] [2020-02-10 19:44:03,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:03,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209141974] [2020-02-10 19:44:03,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:03,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:03,712 INFO L87 Difference]: Start difference. First operand 72 states and 162 transitions. Second operand 7 states. [2020-02-10 19:44:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,767 INFO L93 Difference]: Finished difference Result 106 states and 207 transitions. [2020-02-10 19:44:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:03,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,769 INFO L225 Difference]: With dead ends: 106 [2020-02-10 19:44:03,769 INFO L226 Difference]: Without dead ends: 96 [2020-02-10 19:44:03,769 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 19:44:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-02-10 19:44:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2020-02-10 19:44:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 19:44:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 167 transitions. [2020-02-10 19:44:03,772 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 167 transitions. Word has length 16 [2020-02-10 19:44:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,772 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 167 transitions. [2020-02-10 19:44:03,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 167 transitions. [2020-02-10 19:44:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:03,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,773 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 19:44:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2084126929, now seen corresponding path program 94 times [2020-02-10 19:44:03,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865157773] [2020-02-10 19:44:03,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,915 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 19:44:03,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865157773] [2020-02-10 19:44:03,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:03,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110599620] [2020-02-10 19:44:03,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:03,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:03,917 INFO L87 Difference]: Start difference. First operand 75 states and 167 transitions. Second operand 7 states. [2020-02-10 19:44:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,980 INFO L93 Difference]: Finished difference Result 98 states and 196 transitions. [2020-02-10 19:44:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:03,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,982 INFO L225 Difference]: With dead ends: 98 [2020-02-10 19:44:03,982 INFO L226 Difference]: Without dead ends: 86 [2020-02-10 19:44:03,982 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 19:44:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-02-10 19:44:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2020-02-10 19:44:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 19:44:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 160 transitions. [2020-02-10 19:44:03,984 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 160 transitions. Word has length 16 [2020-02-10 19:44:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,984 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 160 transitions. [2020-02-10 19:44:03,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 160 transitions. [2020-02-10 19:44:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:03,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,985 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 19:44:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash 941654993, now seen corresponding path program 95 times [2020-02-10 19:44:03,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197107661] [2020-02-10 19:44:03,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,121 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 19:44:04,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197107661] [2020-02-10 19:44:04,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:04,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854189685] [2020-02-10 19:44:04,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:04,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:04,122 INFO L87 Difference]: Start difference. First operand 72 states and 160 transitions. Second operand 7 states. [2020-02-10 19:44:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,179 INFO L93 Difference]: Finished difference Result 92 states and 184 transitions. [2020-02-10 19:44:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:04,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:04,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,180 INFO L225 Difference]: With dead ends: 92 [2020-02-10 19:44:04,180 INFO L226 Difference]: Without dead ends: 84 [2020-02-10 19:44:04,180 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 19:44:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-02-10 19:44:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-02-10 19:44:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 19:44:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 163 transitions. [2020-02-10 19:44:04,184 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 163 transitions. Word has length 16 [2020-02-10 19:44:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,184 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 163 transitions. [2020-02-10 19:44:04,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 163 transitions. [2020-02-10 19:44:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:04,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,185 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 19:44:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 942249639, now seen corresponding path program 96 times [2020-02-10 19:44:04,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208975007] [2020-02-10 19:44:04,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,314 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 19:44:04,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208975007] [2020-02-10 19:44:04,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:04,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160220611] [2020-02-10 19:44:04,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:04,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:04,316 INFO L87 Difference]: Start difference. First operand 74 states and 163 transitions. Second operand 7 states. [2020-02-10 19:44:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,370 INFO L93 Difference]: Finished difference Result 83 states and 173 transitions. [2020-02-10 19:44:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:04,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,372 INFO L225 Difference]: With dead ends: 83 [2020-02-10 19:44:04,372 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 19:44:04,372 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 19:44:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 19:44:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-02-10 19:44:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 19:44:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 155 transitions. [2020-02-10 19:44:04,374 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 155 transitions. Word has length 16 [2020-02-10 19:44:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,374 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 155 transitions. [2020-02-10 19:44:04,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 155 transitions. [2020-02-10 19:44:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:04,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,375 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 19:44:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -370908157, now seen corresponding path program 97 times [2020-02-10 19:44:04,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816322209] [2020-02-10 19:44:04,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,538 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 19:44:04,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816322209] [2020-02-10 19:44:04,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:04,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574263203] [2020-02-10 19:44:04,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:04,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:04,541 INFO L87 Difference]: Start difference. First operand 69 states and 155 transitions. Second operand 7 states. [2020-02-10 19:44:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,581 INFO L93 Difference]: Finished difference Result 111 states and 213 transitions. [2020-02-10 19:44:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:04,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,583 INFO L225 Difference]: With dead ends: 111 [2020-02-10 19:44:04,583 INFO L226 Difference]: Without dead ends: 99 [2020-02-10 19:44:04,583 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 19:44:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-02-10 19:44:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2020-02-10 19:44:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 19:44:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 164 transitions. [2020-02-10 19:44:04,586 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 164 transitions. Word has length 16 [2020-02-10 19:44:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,586 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 164 transitions. [2020-02-10 19:44:04,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 164 transitions. [2020-02-10 19:44:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:04,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,587 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 19:44:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash -368774737, now seen corresponding path program 98 times [2020-02-10 19:44:04,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710206723] [2020-02-10 19:44:04,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,725 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 19:44:04,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710206723] [2020-02-10 19:44:04,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:04,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344998049] [2020-02-10 19:44:04,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:04,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:04,726 INFO L87 Difference]: Start difference. First operand 75 states and 164 transitions. Second operand 7 states. [2020-02-10 19:44:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,782 INFO L93 Difference]: Finished difference Result 109 states and 205 transitions. [2020-02-10 19:44:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:04,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,784 INFO L225 Difference]: With dead ends: 109 [2020-02-10 19:44:04,784 INFO L226 Difference]: Without dead ends: 93 [2020-02-10 19:44:04,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 19:44:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-02-10 19:44:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2020-02-10 19:44:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 19:44:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 151 transitions. [2020-02-10 19:44:04,786 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 151 transitions. Word has length 16 [2020-02-10 19:44:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,787 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 151 transitions. [2020-02-10 19:44:04,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 151 transitions. [2020-02-10 19:44:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:04,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,787 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 19:44:04,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1651313597, now seen corresponding path program 99 times [2020-02-10 19:44:04,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726873187] [2020-02-10 19:44:04,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,951 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 19:44:04,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726873187] [2020-02-10 19:44:04,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:04,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976724750] [2020-02-10 19:44:04,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:04,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:04,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:04,954 INFO L87 Difference]: Start difference. First operand 69 states and 151 transitions. Second operand 7 states. [2020-02-10 19:44:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,015 INFO L93 Difference]: Finished difference Result 106 states and 198 transitions. [2020-02-10 19:44:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:05,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,017 INFO L225 Difference]: With dead ends: 106 [2020-02-10 19:44:05,017 INFO L226 Difference]: Without dead ends: 94 [2020-02-10 19:44:05,021 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 19:44:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-02-10 19:44:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2020-02-10 19:44:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 19:44:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 155 transitions. [2020-02-10 19:44:05,030 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 155 transitions. Word has length 16 [2020-02-10 19:44:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,031 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 155 transitions. [2020-02-10 19:44:05,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 155 transitions. [2020-02-10 19:44:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:05,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,035 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 19:44:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1468150063, now seen corresponding path program 100 times [2020-02-10 19:44:05,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576193138] [2020-02-10 19:44:05,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,195 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 19:44:05,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576193138] [2020-02-10 19:44:05,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:05,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904690004] [2020-02-10 19:44:05,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:05,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:05,196 INFO L87 Difference]: Start difference. First operand 72 states and 155 transitions. Second operand 7 states. [2020-02-10 19:44:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,248 INFO L93 Difference]: Finished difference Result 102 states and 188 transitions. [2020-02-10 19:44:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:05,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,249 INFO L225 Difference]: With dead ends: 102 [2020-02-10 19:44:05,250 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 19:44:05,250 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 19:44:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 19:44:05,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2020-02-10 19:44:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 19:44:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 148 transitions. [2020-02-10 19:44:05,252 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 148 transitions. Word has length 16 [2020-02-10 19:44:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,252 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 148 transitions. [2020-02-10 19:44:05,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 148 transitions. [2020-02-10 19:44:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:05,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,253 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 19:44:05,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1834593451, now seen corresponding path program 101 times [2020-02-10 19:44:05,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854722078] [2020-02-10 19:44:05,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,363 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 19:44:05,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854722078] [2020-02-10 19:44:05,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:05,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598436963] [2020-02-10 19:44:05,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:05,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:05,364 INFO L87 Difference]: Start difference. First operand 69 states and 148 transitions. Second operand 7 states. [2020-02-10 19:44:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,411 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2020-02-10 19:44:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:05,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,412 INFO L225 Difference]: With dead ends: 101 [2020-02-10 19:44:05,412 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 19:44:05,413 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 19:44:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 19:44:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2020-02-10 19:44:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 19:44:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 151 transitions. [2020-02-10 19:44:05,415 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 151 transitions. Word has length 16 [2020-02-10 19:44:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,415 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 151 transitions. [2020-02-10 19:44:05,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 151 transitions. [2020-02-10 19:44:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:05,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,420 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 19:44:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1116203925, now seen corresponding path program 102 times [2020-02-10 19:44:05,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740985531] [2020-02-10 19:44:05,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,564 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 19:44:05,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740985531] [2020-02-10 19:44:05,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:05,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961127420] [2020-02-10 19:44:05,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:05,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:05,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:05,566 INFO L87 Difference]: Start difference. First operand 71 states and 151 transitions. Second operand 7 states. [2020-02-10 19:44:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,623 INFO L93 Difference]: Finished difference Result 99 states and 181 transitions. [2020-02-10 19:44:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:05,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,624 INFO L225 Difference]: With dead ends: 99 [2020-02-10 19:44:05,625 INFO L226 Difference]: Without dead ends: 85 [2020-02-10 19:44:05,625 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 19:44:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-02-10 19:44:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2020-02-10 19:44:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-02-10 19:44:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 139 transitions. [2020-02-10 19:44:05,627 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 139 transitions. Word has length 16 [2020-02-10 19:44:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,627 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 139 transitions. [2020-02-10 19:44:05,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 139 transitions. [2020-02-10 19:44:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:05,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,628 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 19:44:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1956127215, now seen corresponding path program 103 times [2020-02-10 19:44:05,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086156898] [2020-02-10 19:44:05,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,783 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 19:44:05,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086156898] [2020-02-10 19:44:05,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:05,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88816262] [2020-02-10 19:44:05,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:05,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:05,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:05,785 INFO L87 Difference]: Start difference. First operand 65 states and 139 transitions. Second operand 7 states. [2020-02-10 19:44:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,870 INFO L93 Difference]: Finished difference Result 101 states and 183 transitions. [2020-02-10 19:44:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:05,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,871 INFO L225 Difference]: With dead ends: 101 [2020-02-10 19:44:05,871 INFO L226 Difference]: Without dead ends: 89 [2020-02-10 19:44:05,871 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 19:44:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-02-10 19:44:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2020-02-10 19:44:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-02-10 19:44:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 134 transitions. [2020-02-10 19:44:05,877 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 134 transitions. Word has length 16 [2020-02-10 19:44:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,878 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 134 transitions. [2020-02-10 19:44:05,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 134 transitions. [2020-02-10 19:44:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:05,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,882 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 19:44:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1953993795, now seen corresponding path program 104 times [2020-02-10 19:44:05,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083472960] [2020-02-10 19:44:05,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,047 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 19:44:06,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083472960] [2020-02-10 19:44:06,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:06,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027206013] [2020-02-10 19:44:06,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:06,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:06,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:06,048 INFO L87 Difference]: Start difference. First operand 65 states and 134 transitions. Second operand 7 states. [2020-02-10 19:44:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,097 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2020-02-10 19:44:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:06,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,098 INFO L225 Difference]: With dead ends: 99 [2020-02-10 19:44:06,098 INFO L226 Difference]: Without dead ends: 83 [2020-02-10 19:44:06,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 19:44:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-02-10 19:44:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2020-02-10 19:44:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-02-10 19:44:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 120 transitions. [2020-02-10 19:44:06,100 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 120 transitions. Word has length 16 [2020-02-10 19:44:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,101 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 120 transitions. [2020-02-10 19:44:06,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 120 transitions. [2020-02-10 19:44:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:06,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,101 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 19:44:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1434938509, now seen corresponding path program 105 times [2020-02-10 19:44:06,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930001931] [2020-02-10 19:44:06,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,237 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 19:44:06,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930001931] [2020-02-10 19:44:06,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:06,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686018984] [2020-02-10 19:44:06,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:06,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:06,239 INFO L87 Difference]: Start difference. First operand 59 states and 120 transitions. Second operand 7 states. [2020-02-10 19:44:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,271 INFO L93 Difference]: Finished difference Result 92 states and 162 transitions. [2020-02-10 19:44:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:06,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,272 INFO L225 Difference]: With dead ends: 92 [2020-02-10 19:44:06,272 INFO L226 Difference]: Without dead ends: 80 [2020-02-10 19:44:06,272 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 19:44:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-02-10 19:44:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2020-02-10 19:44:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-02-10 19:44:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 126 transitions. [2020-02-10 19:44:06,273 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 126 transitions. Word has length 16 [2020-02-10 19:44:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,274 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 126 transitions. [2020-02-10 19:44:06,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 126 transitions. [2020-02-10 19:44:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:06,274 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,275 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 19:44:06,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1473916669, now seen corresponding path program 106 times [2020-02-10 19:44:06,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483905234] [2020-02-10 19:44:06,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,416 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 19:44:06,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483905234] [2020-02-10 19:44:06,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:06,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460192208] [2020-02-10 19:44:06,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:06,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:06,417 INFO L87 Difference]: Start difference. First operand 63 states and 126 transitions. Second operand 7 states. [2020-02-10 19:44:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,473 INFO L93 Difference]: Finished difference Result 82 states and 147 transitions. [2020-02-10 19:44:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:06,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,474 INFO L225 Difference]: With dead ends: 82 [2020-02-10 19:44:06,474 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 19:44:06,475 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 19:44:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 19:44:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2020-02-10 19:44:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-02-10 19:44:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 116 transitions. [2020-02-10 19:44:06,477 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 116 transitions. Word has length 16 [2020-02-10 19:44:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,478 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 116 transitions. [2020-02-10 19:44:06,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 116 transitions. [2020-02-10 19:44:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:06,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,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 19:44:06,479 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 19:44:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash 340355231, now seen corresponding path program 107 times [2020-02-10 19:44:06,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663726324] [2020-02-10 19:44:06,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,629 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 19:44:06,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663726324] [2020-02-10 19:44:06,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:06,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608238203] [2020-02-10 19:44:06,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:06,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:06,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:06,630 INFO L87 Difference]: Start difference. First operand 59 states and 116 transitions. Second operand 7 states. [2020-02-10 19:44:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,685 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2020-02-10 19:44:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:06,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:06,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,686 INFO L225 Difference]: With dead ends: 89 [2020-02-10 19:44:06,686 INFO L226 Difference]: Without dead ends: 79 [2020-02-10 19:44:06,686 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 19:44:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-02-10 19:44:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2020-02-10 19:44:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-02-10 19:44:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 121 transitions. [2020-02-10 19:44:06,688 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 121 transitions. Word has length 16 [2020-02-10 19:44:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,689 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 121 transitions. [2020-02-10 19:44:06,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 121 transitions. [2020-02-10 19:44:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:06,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,690 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 19:44:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 243832391, now seen corresponding path program 108 times [2020-02-10 19:44:06,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528025030] [2020-02-10 19:44:06,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,861 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 19:44:06,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528025030] [2020-02-10 19:44:06,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:06,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653996505] [2020-02-10 19:44:06,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:06,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:06,863 INFO L87 Difference]: Start difference. First operand 62 states and 121 transitions. Second operand 7 states. [2020-02-10 19:44:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,919 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2020-02-10 19:44:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:06,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,920 INFO L225 Difference]: With dead ends: 81 [2020-02-10 19:44:06,920 INFO L226 Difference]: Without dead ends: 63 [2020-02-10 19:44:06,920 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 19:44:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-02-10 19:44:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2020-02-10 19:44:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-02-10 19:44:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2020-02-10 19:44:06,922 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 103 transitions. Word has length 16 [2020-02-10 19:44:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,923 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 103 transitions. [2020-02-10 19:44:06,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 103 transitions. [2020-02-10 19:44:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:06,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,924 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 19:44:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1803137139, now seen corresponding path program 109 times [2020-02-10 19:44:06,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566866013] [2020-02-10 19:44:06,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,080 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 19:44:07,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566866013] [2020-02-10 19:44:07,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:07,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349508941] [2020-02-10 19:44:07,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:07,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:07,081 INFO L87 Difference]: Start difference. First operand 53 states and 103 transitions. Second operand 7 states. [2020-02-10 19:44:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,121 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2020-02-10 19:44:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:07,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,122 INFO L225 Difference]: With dead ends: 81 [2020-02-10 19:44:07,122 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 19:44:07,123 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 19:44:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 19:44:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2020-02-10 19:44:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-02-10 19:44:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 100 transitions. [2020-02-10 19:44:07,125 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 100 transitions. Word has length 16 [2020-02-10 19:44:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,125 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 100 transitions. [2020-02-10 19:44:07,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 100 transitions. [2020-02-10 19:44:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:07,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,126 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 19:44:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash 627633503, now seen corresponding path program 110 times [2020-02-10 19:44:07,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749741067] [2020-02-10 19:44:07,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,266 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 19:44:07,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749741067] [2020-02-10 19:44:07,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:07,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343962492] [2020-02-10 19:44:07,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:07,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:07,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:07,268 INFO L87 Difference]: Start difference. First operand 53 states and 100 transitions. Second operand 7 states. [2020-02-10 19:44:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,335 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2020-02-10 19:44:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:07,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,336 INFO L225 Difference]: With dead ends: 77 [2020-02-10 19:44:07,336 INFO L226 Difference]: Without dead ends: 66 [2020-02-10 19:44:07,336 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 19:44:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-02-10 19:44:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2020-02-10 19:44:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:44:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2020-02-10 19:44:07,338 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 16 [2020-02-10 19:44:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,338 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2020-02-10 19:44:07,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2020-02-10 19:44:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:07,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,339 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 19:44:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1821571165, now seen corresponding path program 111 times [2020-02-10 19:44:07,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841142675] [2020-02-10 19:44:07,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,512 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 19:44:07,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841142675] [2020-02-10 19:44:07,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:07,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245421199] [2020-02-10 19:44:07,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:07,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:07,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:07,515 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 7 states. [2020-02-10 19:44:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,553 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2020-02-10 19:44:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:07,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,554 INFO L225 Difference]: With dead ends: 73 [2020-02-10 19:44:07,554 INFO L226 Difference]: Without dead ends: 61 [2020-02-10 19:44:07,554 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 19:44:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-02-10 19:44:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2020-02-10 19:44:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-02-10 19:44:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2020-02-10 19:44:07,556 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 16 [2020-02-10 19:44:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,556 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. [2020-02-10 19:44:07,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2020-02-10 19:44:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:07,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,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 19:44:07,557 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 19:44:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash 926097059, now seen corresponding path program 112 times [2020-02-10 19:44:07,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47167532] [2020-02-10 19:44:07,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,693 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 19:44:07,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47167532] [2020-02-10 19:44:07,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:07,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213273621] [2020-02-10 19:44:07,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:07,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:07,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:07,695 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand 7 states. [2020-02-10 19:44:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,749 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2020-02-10 19:44:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:07,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,750 INFO L225 Difference]: With dead ends: 63 [2020-02-10 19:44:07,750 INFO L226 Difference]: Without dead ends: 50 [2020-02-10 19:44:07,750 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 19:44:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-02-10 19:44:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-02-10 19:44:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-02-10 19:44:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 70 transitions. [2020-02-10 19:44:07,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 70 transitions. Word has length 16 [2020-02-10 19:44:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,752 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 70 transitions. [2020-02-10 19:44:07,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 70 transitions. [2020-02-10 19:44:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:07,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,753 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 19:44:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1082979805, now seen corresponding path program 113 times [2020-02-10 19:44:07,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864955323] [2020-02-10 19:44:07,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,884 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 19:44:07,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864955323] [2020-02-10 19:44:07,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:07,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304974846] [2020-02-10 19:44:07,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:07,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:07,886 INFO L87 Difference]: Start difference. First operand 40 states and 70 transitions. Second operand 7 states. [2020-02-10 19:44:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,939 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2020-02-10 19:44:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:07,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,940 INFO L225 Difference]: With dead ends: 60 [2020-02-10 19:44:07,940 INFO L226 Difference]: Without dead ends: 52 [2020-02-10 19:44:07,940 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 19:44:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-02-10 19:44:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2020-02-10 19:44:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-02-10 19:44:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-02-10 19:44:07,942 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 16 [2020-02-10 19:44:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,942 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-02-10 19:44:07,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-02-10 19:44:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:07,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,942 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 19:44:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1082385159, now seen corresponding path program 114 times [2020-02-10 19:44:07,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179280279] [2020-02-10 19:44:07,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,087 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 19:44:08,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179280279] [2020-02-10 19:44:08,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:08,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558995672] [2020-02-10 19:44:08,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:08,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:08,088 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 7 states. [2020-02-10 19:44:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,139 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2020-02-10 19:44:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:08,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,140 INFO L225 Difference]: With dead ends: 51 [2020-02-10 19:44:08,141 INFO L226 Difference]: Without dead ends: 37 [2020-02-10 19:44:08,141 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 19:44:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-02-10 19:44:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-02-10 19:44:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 19:44:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2020-02-10 19:44:08,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 16 [2020-02-10 19:44:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,143 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2020-02-10 19:44:08,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2020-02-10 19:44:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:08,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,144 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 19:44:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1811485409, now seen corresponding path program 115 times [2020-02-10 19:44:08,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172975907] [2020-02-10 19:44:08,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,270 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 19:44:08,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172975907] [2020-02-10 19:44:08,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:08,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850922610] [2020-02-10 19:44:08,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:08,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:08,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:08,272 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 7 states. [2020-02-10 19:44:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,321 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2020-02-10 19:44:08,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:08,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,322 INFO L225 Difference]: With dead ends: 54 [2020-02-10 19:44:08,323 INFO L226 Difference]: Without dead ends: 44 [2020-02-10 19:44:08,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 19:44:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-02-10 19:44:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2020-02-10 19:44:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 19:44:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-02-10 19:44:08,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 16 [2020-02-10 19:44:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,325 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-02-10 19:44:08,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-02-10 19:44:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:08,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,325 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 19:44:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash -467315489, now seen corresponding path program 116 times [2020-02-10 19:44:08,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081149389] [2020-02-10 19:44:08,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,449 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 19:44:08,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081149389] [2020-02-10 19:44:08,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:08,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65589299] [2020-02-10 19:44:08,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:08,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:08,451 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 7 states. [2020-02-10 19:44:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,508 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2020-02-10 19:44:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:08,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,509 INFO L225 Difference]: With dead ends: 52 [2020-02-10 19:44:08,509 INFO L226 Difference]: Without dead ends: 42 [2020-02-10 19:44:08,509 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 19:44:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-02-10 19:44:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-02-10 19:44:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 19:44:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-02-10 19:44:08,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 16 [2020-02-10 19:44:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,511 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-02-10 19:44:08,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-02-10 19:44:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:08,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,511 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 19:44:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1793051383, now seen corresponding path program 117 times [2020-02-10 19:44:08,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946517570] [2020-02-10 19:44:08,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,652 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 19:44:08,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946517570] [2020-02-10 19:44:08,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:08,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494153424] [2020-02-10 19:44:08,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:08,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:08,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:08,654 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 7 states. [2020-02-10 19:44:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,707 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2020-02-10 19:44:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:08,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,708 INFO L225 Difference]: With dead ends: 48 [2020-02-10 19:44:08,708 INFO L226 Difference]: Without dead ends: 38 [2020-02-10 19:44:08,708 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 19:44:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-02-10 19:44:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-02-10 19:44:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 19:44:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-02-10 19:44:08,709 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 16 [2020-02-10 19:44:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,709 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-02-10 19:44:08,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-02-10 19:44:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:08,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,710 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 19:44:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1548897127, now seen corresponding path program 118 times [2020-02-10 19:44:08,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205074044] [2020-02-10 19:44:08,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,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 19:44:08,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205074044] [2020-02-10 19:44:08,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:08,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359366198] [2020-02-10 19:44:08,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:08,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:08,847 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 7 states. [2020-02-10 19:44:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,896 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-02-10 19:44:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:08,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,897 INFO L225 Difference]: With dead ends: 40 [2020-02-10 19:44:08,897 INFO L226 Difference]: Without dead ends: 28 [2020-02-10 19:44:08,897 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 19:44:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-02-10 19:44:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-02-10 19:44:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-02-10 19:44:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-02-10 19:44:08,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2020-02-10 19:44:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,899 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-02-10 19:44:08,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-02-10 19:44:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:08,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,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 19:44:08,900 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 19:44:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 406425191, now seen corresponding path program 119 times [2020-02-10 19:44:08,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237836696] [2020-02-10 19:44:08,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,039 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 19:44:09,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237836696] [2020-02-10 19:44:09,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:09,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998803238] [2020-02-10 19:44:09,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:09,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:09,040 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 7 states. [2020-02-10 19:44:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,088 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-02-10 19:44:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:09,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,088 INFO L225 Difference]: With dead ends: 34 [2020-02-10 19:44:09,088 INFO L226 Difference]: Without dead ends: 26 [2020-02-10 19:44:09,089 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 19:44:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-02-10 19:44:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-02-10 19:44:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-02-10 19:44:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-02-10 19:44:09,089 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2020-02-10 19:44:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,090 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-02-10 19:44:09,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-02-10 19:44:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 19:44:09,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,090 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 19:44:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,090 INFO L82 PathProgramCache]: Analyzing trace with hash 407019837, now seen corresponding path program 120 times [2020-02-10 19:44:09,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40333591] [2020-02-10 19:44:09,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,234 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 19:44:09,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40333591] [2020-02-10 19:44:09,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 19:44:09,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569434029] [2020-02-10 19:44:09,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 19:44:09,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 19:44:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:44:09,236 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2020-02-10 19:44:09,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,280 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-02-10 19:44:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 19:44:09,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 19:44:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,280 INFO L225 Difference]: With dead ends: 25 [2020-02-10 19:44:09,280 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 19:44:09,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 19:44:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 19:44:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 19:44:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 19:44:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 19:44:09,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-02-10 19:44:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,282 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 19:44:09,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 19:44:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 19:44:09,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 19:44:09,285 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:44:09 BasicIcfg [2020-02-10 19:44:09,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:44:09,287 INFO L168 Benchmark]: Toolchain (without parser) took 28458.37 ms. Allocated memory was 144.2 MB in the beginning and 548.9 MB in the end (delta: 404.8 MB). Free memory was 119.2 MB in the beginning and 215.0 MB in the end (delta: -95.8 MB). Peak memory consumption was 308.9 MB. Max. memory is 7.1 GB. [2020-02-10 19:44:09,288 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 19:44:09,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.89 ms. Allocated memory is still 144.2 MB. Free memory was 119.0 MB in the beginning and 117.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-02-10 19:44:09,289 INFO L168 Benchmark]: Boogie Preprocessor took 19.60 ms. Allocated memory is still 144.2 MB. Free memory was 117.2 MB in the beginning and 116.3 MB in the end (delta: 933.8 kB). Peak memory consumption was 933.8 kB. Max. memory is 7.1 GB. [2020-02-10 19:44:09,289 INFO L168 Benchmark]: RCFGBuilder took 284.82 ms. Allocated memory is still 144.2 MB. Free memory was 116.1 MB in the beginning and 104.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-02-10 19:44:09,290 INFO L168 Benchmark]: TraceAbstraction took 28113.14 ms. Allocated memory was 144.2 MB in the beginning and 548.9 MB in the end (delta: 404.8 MB). Free memory was 104.2 MB in the beginning and 215.0 MB in the end (delta: -110.8 MB). Peak memory consumption was 293.9 MB. Max. memory is 7.1 GB. [2020-02-10 19:44:09,291 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.25 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.2 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 34.89 ms. Allocated memory is still 144.2 MB. Free memory was 119.0 MB in the beginning and 117.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.60 ms. Allocated memory is still 144.2 MB. Free memory was 117.2 MB in the beginning and 116.3 MB in the end (delta: 933.8 kB). Peak memory consumption was 933.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 284.82 ms. Allocated memory is still 144.2 MB. Free memory was 116.1 MB in the beginning and 104.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28113.14 ms. Allocated memory was 144.2 MB in the beginning and 548.9 MB in the end (delta: 404.8 MB). Free memory was 104.2 MB in the beginning and 215.0 MB in the end (delta: -110.8 MB). Peak memory consumption was 293.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.9s, OverallIterations: 124, TraceHistogramMax: 1, AutomataDifference: 7.3s, 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 20.3s 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.5s 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...