/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_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:43:42,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:43:42,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:43:42,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:43:42,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:43:42,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:43:42,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:43:42,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:43:42,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:43:42,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:43:42,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:43:42,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:43:42,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:43:42,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:43:42,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:43:42,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:43:42,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:43:42,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:43:42,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:43:42,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:43:42,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:43:42,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:43:42,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:43:42,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:43:42,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:43:42,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:43:42,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:43:42,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:43:42,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:43:42,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:43:42,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:43:42,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:43:42,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:43:42,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:43:42,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:43:42,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:43:42,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:43:42,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:43:42,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:43:42,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:43:42,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:43:42,385 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:42,405 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:43:42,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:43:42,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:43:42,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:43:42,409 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:43:42,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:43:42,410 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:43:42,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:43:42,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:43:42,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:43:42,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:43:42,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:43:42,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:43:42,412 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:43:42,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:43:42,413 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:43:42,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:43:42,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:43:42,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:43:42,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:43:42,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:43:42,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:42,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:43:42,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:43:42,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:43:42,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:43:42,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:43:42,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:43:42,416 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:43:42,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:43:42,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:43:42,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:43:42,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:43:42,699 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:43:42,699 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:43:42,700 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl [2020-02-10 19:43:42,700 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl' [2020-02-10 19:43:42,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:43:42,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:43:42,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:42,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:43:42,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:43:42,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:42,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:43:42,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:43:42,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:43:42,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/1) ... [2020-02-10 19:43:42,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:43:42,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:43:42,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:43:42,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:43:42,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (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:42,899 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:43:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:43:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:43:42,901 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:43:42,901 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:43:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:43:42,902 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:43:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:43:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:43:42,902 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:43:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:43:42,903 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:43:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:43:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:43:42,904 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:43:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:43:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:43:42,904 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:43:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:43:42,905 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:43:42,906 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:43,103 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:43:43,103 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:43:43,108 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:43 BoogieIcfgContainer [2020-02-10 19:43:43,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:43:43,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:43:43,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:43:43,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:43:43,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:42" (1/2) ... [2020-02-10 19:43:43,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551459bf and model type example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:43:43, skipping insertion in model container [2020-02-10 19:43:43,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:43" (2/2) ... [2020-02-10 19:43:43,117 INFO L109 eAbstractionObserver]: Analyzing ICFG example_6.bpl [2020-02-10 19:43:43,129 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:43:43,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:43:43,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:43:43,139 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:43:43,372 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-02-10 19:43:43,396 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:43:43,396 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:43:43,396 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:43:43,397 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:43:43,397 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:43:43,397 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:43:43,397 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:43:43,397 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:43:43,412 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 63 transitions [2020-02-10 19:43:43,414 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-02-10 19:43:43,552 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-02-10 19:43:43,552 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-02-10 19:43:43,562 INFO L76 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 213 events. 129/213 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 773 event pairs. 0/212 useless extension candidates. Maximal degree in co-relation 187. Up to 60 conditions per place. [2020-02-10 19:43:43,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-02-10 19:43:43,622 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-02-10 19:43:43,623 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-02-10 19:43:43,627 INFO L76 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 213 events. 129/213 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 773 event pairs. 0/212 useless extension candidates. Maximal degree in co-relation 187. Up to 60 conditions per place. [2020-02-10 19:43:43,635 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 780 [2020-02-10 19:43:43,636 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:43:43,786 INFO L206 etLargeBlockEncoding]: Checked pairs total: 225 [2020-02-10 19:43:43,787 INFO L214 etLargeBlockEncoding]: Total number of compositions: 7 [2020-02-10 19:43:43,791 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 56 transitions [2020-02-10 19:43:43,871 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 794 states. [2020-02-10 19:43:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states. [2020-02-10 19:43:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:43,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:43,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:43,904 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash -773222054, now seen corresponding path program 1 times [2020-02-10 19:43:43,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:43,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832273421] [2020-02-10 19:43:43,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:44,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832273421] [2020-02-10 19:43:44,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:44,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:44,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917427081] [2020-02-10 19:43:44,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:44,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:44,099 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 3 states. [2020-02-10 19:43:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:44,165 INFO L93 Difference]: Finished difference Result 602 states and 2198 transitions. [2020-02-10 19:43:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:44,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 19:43:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:44,194 INFO L225 Difference]: With dead ends: 602 [2020-02-10 19:43:44,194 INFO L226 Difference]: Without dead ends: 601 [2020-02-10 19:43:44,195 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:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-02-10 19:43:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2020-02-10 19:43:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-02-10 19:43:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2197 transitions. [2020-02-10 19:43:44,309 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2197 transitions. Word has length 19 [2020-02-10 19:43:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:44,311 INFO L479 AbstractCegarLoop]: Abstraction has 601 states and 2197 transitions. [2020-02-10 19:43:44,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2197 transitions. [2020-02-10 19:43:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:44,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:44,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:44,316 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash 969558490, now seen corresponding path program 1 times [2020-02-10 19:43:44,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:44,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389552141] [2020-02-10 19:43:44,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:44,368 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,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389552141] [2020-02-10 19:43:44,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:44,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:44,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469788989] [2020-02-10 19:43:44,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:44,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:44,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:44,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:44,373 INFO L87 Difference]: Start difference. First operand 601 states and 2197 transitions. Second operand 3 states. [2020-02-10 19:43:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:44,400 INFO L93 Difference]: Finished difference Result 417 states and 1445 transitions. [2020-02-10 19:43:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:44,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 19:43:44,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:44,409 INFO L225 Difference]: With dead ends: 417 [2020-02-10 19:43:44,409 INFO L226 Difference]: Without dead ends: 417 [2020-02-10 19:43:44,410 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:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-02-10 19:43:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2020-02-10 19:43:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-02-10 19:43:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1445 transitions. [2020-02-10 19:43:44,442 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1445 transitions. Word has length 19 [2020-02-10 19:43:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:44,442 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 1445 transitions. [2020-02-10 19:43:44,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1445 transitions. [2020-02-10 19:43:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:44,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:44,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:44,445 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash 160210872, now seen corresponding path program 1 times [2020-02-10 19:43:44,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:44,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255192346] [2020-02-10 19:43:44,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:44,916 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 19:43:45,020 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,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255192346] [2020-02-10 19:43:45,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:45,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73859727] [2020-02-10 19:43:45,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:45,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:45,026 INFO L87 Difference]: Start difference. First operand 417 states and 1445 transitions. Second operand 8 states. [2020-02-10 19:43:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:45,173 INFO L93 Difference]: Finished difference Result 861 states and 2672 transitions. [2020-02-10 19:43:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:45,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:45,181 INFO L225 Difference]: With dead ends: 861 [2020-02-10 19:43:45,182 INFO L226 Difference]: Without dead ends: 823 [2020-02-10 19:43:45,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-02-10 19:43:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 447. [2020-02-10 19:43:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-02-10 19:43:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1541 transitions. [2020-02-10 19:43:45,210 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1541 transitions. Word has length 19 [2020-02-10 19:43:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:45,211 INFO L479 AbstractCegarLoop]: Abstraction has 447 states and 1541 transitions. [2020-02-10 19:43:45,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1541 transitions. [2020-02-10 19:43:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:45,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:45,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:45,214 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash 534862058, now seen corresponding path program 2 times [2020-02-10 19:43:45,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:45,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81011300] [2020-02-10 19:43:45,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:45,639 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,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81011300] [2020-02-10 19:43:45,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:45,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:45,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42679244] [2020-02-10 19:43:45,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:45,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:45,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:45,643 INFO L87 Difference]: Start difference. First operand 447 states and 1541 transitions. Second operand 8 states. [2020-02-10 19:43:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:45,793 INFO L93 Difference]: Finished difference Result 871 states and 2699 transitions. [2020-02-10 19:43:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:45,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:45,800 INFO L225 Difference]: With dead ends: 871 [2020-02-10 19:43:45,801 INFO L226 Difference]: Without dead ends: 812 [2020-02-10 19:43:45,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-02-10 19:43:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 436. [2020-02-10 19:43:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 19:43:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1507 transitions. [2020-02-10 19:43:45,828 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1507 transitions. Word has length 19 [2020-02-10 19:43:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:45,828 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1507 transitions. [2020-02-10 19:43:45,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1507 transitions. [2020-02-10 19:43:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:45,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:45,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:45,831 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:45,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:45,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1341600626, now seen corresponding path program 3 times [2020-02-10 19:43:45,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:45,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768126111] [2020-02-10 19:43:45,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,243 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,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768126111] [2020-02-10 19:43:46,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:46,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795648535] [2020-02-10 19:43:46,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:46,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:46,248 INFO L87 Difference]: Start difference. First operand 436 states and 1507 transitions. Second operand 8 states. [2020-02-10 19:43:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,342 INFO L93 Difference]: Finished difference Result 855 states and 2646 transitions. [2020-02-10 19:43:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:46,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,350 INFO L225 Difference]: With dead ends: 855 [2020-02-10 19:43:46,350 INFO L226 Difference]: Without dead ends: 817 [2020-02-10 19:43:46,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2020-02-10 19:43:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 445. [2020-02-10 19:43:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-02-10 19:43:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1528 transitions. [2020-02-10 19:43:46,373 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1528 transitions. Word has length 19 [2020-02-10 19:43:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,374 INFO L479 AbstractCegarLoop]: Abstraction has 445 states and 1528 transitions. [2020-02-10 19:43:46,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1528 transitions. [2020-02-10 19:43:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:46,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:46,376 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 365395876, now seen corresponding path program 4 times [2020-02-10 19:43:46,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609835894] [2020-02-10 19:43:46,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:46,778 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,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609835894] [2020-02-10 19:43:46,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:46,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:46,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317426228] [2020-02-10 19:43:46,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:46,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:46,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:46,780 INFO L87 Difference]: Start difference. First operand 445 states and 1528 transitions. Second operand 8 states. [2020-02-10 19:43:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:46,881 INFO L93 Difference]: Finished difference Result 861 states and 2662 transitions. [2020-02-10 19:43:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:46,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:46,888 INFO L225 Difference]: With dead ends: 861 [2020-02-10 19:43:46,889 INFO L226 Difference]: Without dead ends: 808 [2020-02-10 19:43:46,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-02-10 19:43:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 436. [2020-02-10 19:43:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 19:43:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1498 transitions. [2020-02-10 19:43:46,911 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1498 transitions. Word has length 19 [2020-02-10 19:43:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:46,912 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1498 transitions. [2020-02-10 19:43:46,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1498 transitions. [2020-02-10 19:43:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:46,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:46,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:46,914 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1763599130, now seen corresponding path program 5 times [2020-02-10 19:43:46,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:46,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230431808] [2020-02-10 19:43:46,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:47,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:47,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230431808] [2020-02-10 19:43:47,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:47,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:47,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944379137] [2020-02-10 19:43:47,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:47,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:47,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:47,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:47,191 INFO L87 Difference]: Start difference. First operand 436 states and 1498 transitions. Second operand 8 states. [2020-02-10 19:43:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,289 INFO L93 Difference]: Finished difference Result 882 states and 2745 transitions. [2020-02-10 19:43:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:47,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,296 INFO L225 Difference]: With dead ends: 882 [2020-02-10 19:43:47,297 INFO L226 Difference]: Without dead ends: 834 [2020-02-10 19:43:47,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-02-10 19:43:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 452. [2020-02-10 19:43:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-02-10 19:43:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1546 transitions. [2020-02-10 19:43:47,326 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1546 transitions. Word has length 19 [2020-02-10 19:43:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,327 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1546 transitions. [2020-02-10 19:43:47,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1546 transitions. [2020-02-10 19:43:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:47,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:47,333 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash -905319246, now seen corresponding path program 6 times [2020-02-10 19:43:47,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838025826] [2020-02-10 19:43:47,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:47,612 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,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838025826] [2020-02-10 19:43:47,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:47,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:47,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087960521] [2020-02-10 19:43:47,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:47,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:47,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:47,615 INFO L87 Difference]: Start difference. First operand 452 states and 1546 transitions. Second operand 8 states. [2020-02-10 19:43:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:47,731 INFO L93 Difference]: Finished difference Result 878 states and 2717 transitions. [2020-02-10 19:43:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:47,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:47,740 INFO L225 Difference]: With dead ends: 878 [2020-02-10 19:43:47,741 INFO L226 Difference]: Without dead ends: 807 [2020-02-10 19:43:47,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-02-10 19:43:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 425. [2020-02-10 19:43:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 19:43:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1468 transitions. [2020-02-10 19:43:47,769 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1468 transitions. Word has length 19 [2020-02-10 19:43:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:47,770 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1468 transitions. [2020-02-10 19:43:47,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1468 transitions. [2020-02-10 19:43:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:47,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:47,773 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash 903297962, now seen corresponding path program 7 times [2020-02-10 19:43:47,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:47,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110166852] [2020-02-10 19:43:47,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,038 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,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110166852] [2020-02-10 19:43:48,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:48,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65051737] [2020-02-10 19:43:48,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:48,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:48,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:48,041 INFO L87 Difference]: Start difference. First operand 425 states and 1468 transitions. Second operand 8 states. [2020-02-10 19:43:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,121 INFO L93 Difference]: Finished difference Result 838 states and 2569 transitions. [2020-02-10 19:43:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:48,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,129 INFO L225 Difference]: With dead ends: 838 [2020-02-10 19:43:48,129 INFO L226 Difference]: Without dead ends: 800 [2020-02-10 19:43:48,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-02-10 19:43:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 442. [2020-02-10 19:43:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-02-10 19:43:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1513 transitions. [2020-02-10 19:43:48,155 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1513 transitions. Word has length 19 [2020-02-10 19:43:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,156 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1513 transitions. [2020-02-10 19:43:48,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1513 transitions. [2020-02-10 19:43:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:48,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:48,159 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1277949148, now seen corresponding path program 8 times [2020-02-10 19:43:48,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086825895] [2020-02-10 19:43:48,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,425 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,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086825895] [2020-02-10 19:43:48,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:48,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972233046] [2020-02-10 19:43:48,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:48,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:48,430 INFO L87 Difference]: Start difference. First operand 442 states and 1513 transitions. Second operand 8 states. [2020-02-10 19:43:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,532 INFO L93 Difference]: Finished difference Result 848 states and 2596 transitions. [2020-02-10 19:43:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:48,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,539 INFO L225 Difference]: With dead ends: 848 [2020-02-10 19:43:48,539 INFO L226 Difference]: Without dead ends: 789 [2020-02-10 19:43:48,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-02-10 19:43:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 431. [2020-02-10 19:43:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-02-10 19:43:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1483 transitions. [2020-02-10 19:43:48,559 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1483 transitions. Word has length 19 [2020-02-10 19:43:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,559 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 1483 transitions. [2020-02-10 19:43:48,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1483 transitions. [2020-02-10 19:43:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:48,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:48,561 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1759091492, now seen corresponding path program 9 times [2020-02-10 19:43:48,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37111628] [2020-02-10 19:43:48,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,812 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,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37111628] [2020-02-10 19:43:48,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:48,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758830048] [2020-02-10 19:43:48,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:48,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:48,814 INFO L87 Difference]: Start difference. First operand 431 states and 1483 transitions. Second operand 8 states. [2020-02-10 19:43:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,878 INFO L93 Difference]: Finished difference Result 821 states and 2505 transitions. [2020-02-10 19:43:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:48,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,883 INFO L225 Difference]: With dead ends: 821 [2020-02-10 19:43:48,883 INFO L226 Difference]: Without dead ends: 783 [2020-02-10 19:43:48,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2020-02-10 19:43:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 436. [2020-02-10 19:43:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-02-10 19:43:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1492 transitions. [2020-02-10 19:43:48,902 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1492 transitions. Word has length 19 [2020-02-10 19:43:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:48,902 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1492 transitions. [2020-02-10 19:43:48,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1492 transitions. [2020-02-10 19:43:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:48,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:48,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:48,904 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1008029398, now seen corresponding path program 10 times [2020-02-10 19:43:48,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21135418] [2020-02-10 19:43:48,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,120 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,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21135418] [2020-02-10 19:43:49,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:49,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027392500] [2020-02-10 19:43:49,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:49,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:49,122 INFO L87 Difference]: Start difference. First operand 436 states and 1492 transitions. Second operand 8 states. [2020-02-10 19:43:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,217 INFO L93 Difference]: Finished difference Result 820 states and 2499 transitions. [2020-02-10 19:43:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:49,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,223 INFO L225 Difference]: With dead ends: 820 [2020-02-10 19:43:49,223 INFO L226 Difference]: Without dead ends: 778 [2020-02-10 19:43:49,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-02-10 19:43:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 431. [2020-02-10 19:43:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-02-10 19:43:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1478 transitions. [2020-02-10 19:43:49,240 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1478 transitions. Word has length 19 [2020-02-10 19:43:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,241 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 1478 transitions. [2020-02-10 19:43:49,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1478 transitions. [2020-02-10 19:43:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:49,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,243 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash -262091078, now seen corresponding path program 11 times [2020-02-10 19:43:49,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978643043] [2020-02-10 19:43:49,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:49,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978643043] [2020-02-10 19:43:49,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:49,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689517945] [2020-02-10 19:43:49,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:49,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:49,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:49,513 INFO L87 Difference]: Start difference. First operand 431 states and 1478 transitions. Second operand 8 states. [2020-02-10 19:43:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,620 INFO L93 Difference]: Finished difference Result 845 states and 2591 transitions. [2020-02-10 19:43:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:49,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,626 INFO L225 Difference]: With dead ends: 845 [2020-02-10 19:43:49,627 INFO L226 Difference]: Without dead ends: 797 [2020-02-10 19:43:49,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2020-02-10 19:43:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 440. [2020-02-10 19:43:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-02-10 19:43:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1500 transitions. [2020-02-10 19:43:49,646 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1500 transitions. Word has length 19 [2020-02-10 19:43:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,646 INFO L479 AbstractCegarLoop]: Abstraction has 440 states and 1500 transitions. [2020-02-10 19:43:49,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1500 transitions. [2020-02-10 19:43:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:49,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,649 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,649 INFO L82 PathProgramCache]: Analyzing trace with hash -262685724, now seen corresponding path program 12 times [2020-02-10 19:43:49,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761128081] [2020-02-10 19:43:49,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,854 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,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761128081] [2020-02-10 19:43:49,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:49,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752258002] [2020-02-10 19:43:49,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:49,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:49,857 INFO L87 Difference]: Start difference. First operand 440 states and 1500 transitions. Second operand 8 states. [2020-02-10 19:43:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,959 INFO L93 Difference]: Finished difference Result 834 states and 2544 transitions. [2020-02-10 19:43:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:49,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,967 INFO L225 Difference]: With dead ends: 834 [2020-02-10 19:43:49,967 INFO L226 Difference]: Without dead ends: 782 [2020-02-10 19:43:49,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-02-10 19:43:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 425. [2020-02-10 19:43:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 19:43:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1462 transitions. [2020-02-10 19:43:49,989 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1462 transitions. Word has length 19 [2020-02-10 19:43:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,990 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1462 transitions. [2020-02-10 19:43:49,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1462 transitions. [2020-02-10 19:43:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:49,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,993 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:49,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,993 INFO L82 PathProgramCache]: Analyzing trace with hash -272531798, now seen corresponding path program 13 times [2020-02-10 19:43:49,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995991394] [2020-02-10 19:43:49,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,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:50,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995991394] [2020-02-10 19:43:50,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:50,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055864787] [2020-02-10 19:43:50,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:50,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:50,290 INFO L87 Difference]: Start difference. First operand 425 states and 1462 transitions. Second operand 8 states. [2020-02-10 19:43:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,364 INFO L93 Difference]: Finished difference Result 813 states and 2484 transitions. [2020-02-10 19:43:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:50,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,370 INFO L225 Difference]: With dead ends: 813 [2020-02-10 19:43:50,372 INFO L226 Difference]: Without dead ends: 775 [2020-02-10 19:43:50,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-02-10 19:43:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 435. [2020-02-10 19:43:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 19:43:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1490 transitions. [2020-02-10 19:43:50,395 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1490 transitions. Word has length 19 [2020-02-10 19:43:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,396 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1490 transitions. [2020-02-10 19:43:50,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1490 transitions. [2020-02-10 19:43:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:50,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,398 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1023593892, now seen corresponding path program 14 times [2020-02-10 19:43:50,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79337739] [2020-02-10 19:43:50,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,670 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,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79337739] [2020-02-10 19:43:50,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:50,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985496680] [2020-02-10 19:43:50,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:50,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:50,672 INFO L87 Difference]: Start difference. First operand 435 states and 1490 transitions. Second operand 8 states. [2020-02-10 19:43:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,767 INFO L93 Difference]: Finished difference Result 812 states and 2478 transitions. [2020-02-10 19:43:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:50,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,773 INFO L225 Difference]: With dead ends: 812 [2020-02-10 19:43:50,774 INFO L226 Difference]: Without dead ends: 770 [2020-02-10 19:43:50,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-02-10 19:43:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 430. [2020-02-10 19:43:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 19:43:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-02-10 19:43:50,791 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-02-10 19:43:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,792 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-02-10 19:43:50,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-02-10 19:43:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:50,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,794 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1872969652, now seen corresponding path program 15 times [2020-02-10 19:43:50,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359782540] [2020-02-10 19:43:50,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,048 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,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359782540] [2020-02-10 19:43:51,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:51,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718302020] [2020-02-10 19:43:51,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:51,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:51,050 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-02-10 19:43:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,109 INFO L93 Difference]: Finished difference Result 824 states and 2521 transitions. [2020-02-10 19:43:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:51,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,116 INFO L225 Difference]: With dead ends: 824 [2020-02-10 19:43:51,117 INFO L226 Difference]: Without dead ends: 786 [2020-02-10 19:43:51,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-02-10 19:43:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 439. [2020-02-10 19:43:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-02-10 19:43:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1497 transitions. [2020-02-10 19:43:51,133 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1497 transitions. Word has length 19 [2020-02-10 19:43:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,134 INFO L479 AbstractCegarLoop]: Abstraction has 439 states and 1497 transitions. [2020-02-10 19:43:51,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1497 transitions. [2020-02-10 19:43:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:51,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,135 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,136 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1445792894, now seen corresponding path program 16 times [2020-02-10 19:43:51,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119532715] [2020-02-10 19:43:51,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,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:43:51,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119532715] [2020-02-10 19:43:51,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:51,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123469121] [2020-02-10 19:43:51,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:51,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:51,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:51,366 INFO L87 Difference]: Start difference. First operand 439 states and 1497 transitions. Second operand 8 states. [2020-02-10 19:43:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,479 INFO L93 Difference]: Finished difference Result 830 states and 2537 transitions. [2020-02-10 19:43:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:51,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,485 INFO L225 Difference]: With dead ends: 830 [2020-02-10 19:43:51,485 INFO L226 Difference]: Without dead ends: 777 [2020-02-10 19:43:51,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:51,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2020-02-10 19:43:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 430. [2020-02-10 19:43:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 19:43:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1471 transitions. [2020-02-10 19:43:51,502 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1471 transitions. Word has length 19 [2020-02-10 19:43:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,502 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1471 transitions. [2020-02-10 19:43:51,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1471 transitions. [2020-02-10 19:43:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:51,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,504 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1221170070, now seen corresponding path program 17 times [2020-02-10 19:43:51,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316528978] [2020-02-10 19:43:51,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,767 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,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316528978] [2020-02-10 19:43:51,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:51,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072311239] [2020-02-10 19:43:51,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:51,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:51,769 INFO L87 Difference]: Start difference. First operand 430 states and 1471 transitions. Second operand 8 states. [2020-02-10 19:43:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,858 INFO L93 Difference]: Finished difference Result 821 states and 2512 transitions. [2020-02-10 19:43:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:51,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,863 INFO L225 Difference]: With dead ends: 821 [2020-02-10 19:43:51,864 INFO L226 Difference]: Without dead ends: 784 [2020-02-10 19:43:51,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-02-10 19:43:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 438. [2020-02-10 19:43:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-02-10 19:43:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1491 transitions. [2020-02-10 19:43:51,880 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1491 transitions. Word has length 19 [2020-02-10 19:43:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,880 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 1491 transitions. [2020-02-10 19:43:51,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1491 transitions. [2020-02-10 19:43:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:51,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,882 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash -362295540, now seen corresponding path program 18 times [2020-02-10 19:43:51,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672639369] [2020-02-10 19:43:51,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,105 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,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672639369] [2020-02-10 19:43:52,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:52,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278514465] [2020-02-10 19:43:52,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:52,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:52,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:52,107 INFO L87 Difference]: Start difference. First operand 438 states and 1491 transitions. Second operand 8 states. [2020-02-10 19:43:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,203 INFO L93 Difference]: Finished difference Result 828 states and 2530 transitions. [2020-02-10 19:43:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:52,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,210 INFO L225 Difference]: With dead ends: 828 [2020-02-10 19:43:52,210 INFO L226 Difference]: Without dead ends: 771 [2020-02-10 19:43:52,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-02-10 19:43:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 425. [2020-02-10 19:43:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-02-10 19:43:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1457 transitions. [2020-02-10 19:43:52,226 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1457 transitions. Word has length 19 [2020-02-10 19:43:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,226 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1457 transitions. [2020-02-10 19:43:52,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1457 transitions. [2020-02-10 19:43:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:52,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,228 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,228 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1500056126, now seen corresponding path program 19 times [2020-02-10 19:43:52,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602194833] [2020-02-10 19:43:52,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,464 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,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602194833] [2020-02-10 19:43:52,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:52,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344713558] [2020-02-10 19:43:52,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:52,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:52,467 INFO L87 Difference]: Start difference. First operand 425 states and 1457 transitions. Second operand 8 states. [2020-02-10 19:43:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,566 INFO L93 Difference]: Finished difference Result 861 states and 2675 transitions. [2020-02-10 19:43:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:52,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,571 INFO L225 Difference]: With dead ends: 861 [2020-02-10 19:43:52,571 INFO L226 Difference]: Without dead ends: 813 [2020-02-10 19:43:52,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-02-10 19:43:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 442. [2020-02-10 19:43:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-02-10 19:43:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1515 transitions. [2020-02-10 19:43:52,592 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1515 transitions. Word has length 19 [2020-02-10 19:43:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,592 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 1515 transitions. [2020-02-10 19:43:52,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1515 transitions. [2020-02-10 19:43:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:52,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,595 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1499461480, now seen corresponding path program 20 times [2020-02-10 19:43:52,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195707071] [2020-02-10 19:43:52,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,835 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,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195707071] [2020-02-10 19:43:52,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:52,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613174028] [2020-02-10 19:43:52,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:52,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:52,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:52,837 INFO L87 Difference]: Start difference. First operand 442 states and 1515 transitions. Second operand 8 states. [2020-02-10 19:43:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,928 INFO L93 Difference]: Finished difference Result 850 states and 2628 transitions. [2020-02-10 19:43:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:52,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,932 INFO L225 Difference]: With dead ends: 850 [2020-02-10 19:43:52,932 INFO L226 Difference]: Without dead ends: 804 [2020-02-10 19:43:52,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2020-02-10 19:43:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 433. [2020-02-10 19:43:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-02-10 19:43:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1485 transitions. [2020-02-10 19:43:52,950 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1485 transitions. Word has length 19 [2020-02-10 19:43:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,951 INFO L479 AbstractCegarLoop]: Abstraction has 433 states and 1485 transitions. [2020-02-10 19:43:52,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1485 transitions. [2020-02-10 19:43:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:52,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,953 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1939604516, now seen corresponding path program 21 times [2020-02-10 19:43:52,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284558577] [2020-02-10 19:43:52,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,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:43:53,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284558577] [2020-02-10 19:43:53,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:53,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056748424] [2020-02-10 19:43:53,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:53,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:53,198 INFO L87 Difference]: Start difference. First operand 433 states and 1485 transitions. Second operand 8 states. [2020-02-10 19:43:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,280 INFO L93 Difference]: Finished difference Result 875 states and 2726 transitions. [2020-02-10 19:43:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:53,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,284 INFO L225 Difference]: With dead ends: 875 [2020-02-10 19:43:53,284 INFO L226 Difference]: Without dead ends: 827 [2020-02-10 19:43:53,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2020-02-10 19:43:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 449. [2020-02-10 19:43:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-02-10 19:43:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1533 transitions. [2020-02-10 19:43:53,299 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1533 transitions. Word has length 19 [2020-02-10 19:43:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,300 INFO L479 AbstractCegarLoop]: Abstraction has 449 states and 1533 transitions. [2020-02-10 19:43:53,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1533 transitions. [2020-02-10 19:43:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:53,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,302 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1081324632, now seen corresponding path program 22 times [2020-02-10 19:43:53,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256339418] [2020-02-10 19:43:53,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:53,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256339418] [2020-02-10 19:43:53,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:53,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163266035] [2020-02-10 19:43:53,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:53,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:53,530 INFO L87 Difference]: Start difference. First operand 449 states and 1533 transitions. Second operand 8 states. [2020-02-10 19:43:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,617 INFO L93 Difference]: Finished difference Result 871 states and 2698 transitions. [2020-02-10 19:43:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:53,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,620 INFO L225 Difference]: With dead ends: 871 [2020-02-10 19:43:53,621 INFO L226 Difference]: Without dead ends: 811 [2020-02-10 19:43:53,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-02-10 19:43:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 433. [2020-02-10 19:43:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-02-10 19:43:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1477 transitions. [2020-02-10 19:43:53,634 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1477 transitions. Word has length 19 [2020-02-10 19:43:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,635 INFO L479 AbstractCegarLoop]: Abstraction has 433 states and 1477 transitions. [2020-02-10 19:43:53,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1477 transitions. [2020-02-10 19:43:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:53,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,637 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1958633188, now seen corresponding path program 23 times [2020-02-10 19:43:53,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704029064] [2020-02-10 19:43:53,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,851 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,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704029064] [2020-02-10 19:43:53,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:53,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620126875] [2020-02-10 19:43:53,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:53,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:53,853 INFO L87 Difference]: Start difference. First operand 433 states and 1477 transitions. Second operand 8 states. [2020-02-10 19:43:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,940 INFO L93 Difference]: Finished difference Result 845 states and 2606 transitions. [2020-02-10 19:43:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:53,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,943 INFO L225 Difference]: With dead ends: 845 [2020-02-10 19:43:53,943 INFO L226 Difference]: Without dead ends: 808 [2020-02-10 19:43:53,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-02-10 19:43:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 441. [2020-02-10 19:43:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-02-10 19:43:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1497 transitions. [2020-02-10 19:43:53,958 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1497 transitions. Word has length 19 [2020-02-10 19:43:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,958 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1497 transitions. [2020-02-10 19:43:53,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1497 transitions. [2020-02-10 19:43:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:53,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,961 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1099758658, now seen corresponding path program 24 times [2020-02-10 19:43:53,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679073864] [2020-02-10 19:43:53,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,186 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,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679073864] [2020-02-10 19:43:54,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:54,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249668002] [2020-02-10 19:43:54,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:54,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:54,188 INFO L87 Difference]: Start difference. First operand 441 states and 1497 transitions. Second operand 8 states. [2020-02-10 19:43:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,262 INFO L93 Difference]: Finished difference Result 852 states and 2624 transitions. [2020-02-10 19:43:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:54,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,265 INFO L225 Difference]: With dead ends: 852 [2020-02-10 19:43:54,265 INFO L226 Difference]: Without dead ends: 784 [2020-02-10 19:43:54,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-02-10 19:43:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 417. [2020-02-10 19:43:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-02-10 19:43:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1439 transitions. [2020-02-10 19:43:54,280 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1439 transitions. Word has length 19 [2020-02-10 19:43:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,280 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 1439 transitions. [2020-02-10 19:43:54,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1439 transitions. [2020-02-10 19:43:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:54,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,283 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1228367856, now seen corresponding path program 25 times [2020-02-10 19:43:54,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371671383] [2020-02-10 19:43:54,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,546 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,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371671383] [2020-02-10 19:43:54,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:54,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075053513] [2020-02-10 19:43:54,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:54,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:54,547 INFO L87 Difference]: Start difference. First operand 417 states and 1439 transitions. Second operand 8 states. [2020-02-10 19:43:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,618 INFO L93 Difference]: Finished difference Result 860 states and 2665 transitions. [2020-02-10 19:43:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:54,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,622 INFO L225 Difference]: With dead ends: 860 [2020-02-10 19:43:54,622 INFO L226 Difference]: Without dead ends: 822 [2020-02-10 19:43:54,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-02-10 19:43:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 446. [2020-02-10 19:43:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-02-10 19:43:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1534 transitions. [2020-02-10 19:43:54,638 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1534 transitions. Word has length 19 [2020-02-10 19:43:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,638 INFO L479 AbstractCegarLoop]: Abstraction has 446 states and 1534 transitions. [2020-02-10 19:43:54,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1534 transitions. [2020-02-10 19:43:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:54,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,640 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash -853716670, now seen corresponding path program 26 times [2020-02-10 19:43:54,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587590034] [2020-02-10 19:43:54,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,889 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,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587590034] [2020-02-10 19:43:54,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:54,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189982186] [2020-02-10 19:43:54,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:54,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:54,891 INFO L87 Difference]: Start difference. First operand 446 states and 1534 transitions. Second operand 8 states. [2020-02-10 19:43:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,971 INFO L93 Difference]: Finished difference Result 870 states and 2692 transitions. [2020-02-10 19:43:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:54,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,974 INFO L225 Difference]: With dead ends: 870 [2020-02-10 19:43:54,974 INFO L226 Difference]: Without dead ends: 811 [2020-02-10 19:43:54,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-02-10 19:43:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 435. [2020-02-10 19:43:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 19:43:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1500 transitions. [2020-02-10 19:43:54,989 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1500 transitions. Word has length 19 [2020-02-10 19:43:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,990 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1500 transitions. [2020-02-10 19:43:54,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1500 transitions. [2020-02-10 19:43:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:54,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,992 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash -46978102, now seen corresponding path program 27 times [2020-02-10 19:43:54,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957956476] [2020-02-10 19:43:54,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:55,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957956476] [2020-02-10 19:43:55,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:55,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955250105] [2020-02-10 19:43:55,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:55,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:55,237 INFO L87 Difference]: Start difference. First operand 435 states and 1500 transitions. Second operand 8 states. [2020-02-10 19:43:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,300 INFO L93 Difference]: Finished difference Result 854 states and 2639 transitions. [2020-02-10 19:43:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:55,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,304 INFO L225 Difference]: With dead ends: 854 [2020-02-10 19:43:55,304 INFO L226 Difference]: Without dead ends: 816 [2020-02-10 19:43:55,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-02-10 19:43:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 444. [2020-02-10 19:43:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-02-10 19:43:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1521 transitions. [2020-02-10 19:43:55,323 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1521 transitions. Word has length 19 [2020-02-10 19:43:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,323 INFO L479 AbstractCegarLoop]: Abstraction has 444 states and 1521 transitions. [2020-02-10 19:43:55,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1521 transitions. [2020-02-10 19:43:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:55,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,325 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1023182852, now seen corresponding path program 28 times [2020-02-10 19:43:55,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123098943] [2020-02-10 19:43:55,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,570 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,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123098943] [2020-02-10 19:43:55,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:55,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822323156] [2020-02-10 19:43:55,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:55,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:55,572 INFO L87 Difference]: Start difference. First operand 444 states and 1521 transitions. Second operand 8 states. [2020-02-10 19:43:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,654 INFO L93 Difference]: Finished difference Result 860 states and 2655 transitions. [2020-02-10 19:43:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:55,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,658 INFO L225 Difference]: With dead ends: 860 [2020-02-10 19:43:55,658 INFO L226 Difference]: Without dead ends: 807 [2020-02-10 19:43:55,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-02-10 19:43:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 435. [2020-02-10 19:43:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 19:43:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1491 transitions. [2020-02-10 19:43:55,673 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1491 transitions. Word has length 19 [2020-02-10 19:43:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,673 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1491 transitions. [2020-02-10 19:43:55,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1491 transitions. [2020-02-10 19:43:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:55,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,675 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789438, now seen corresponding path program 29 times [2020-02-10 19:43:55,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698658432] [2020-02-10 19:43:55,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,909 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,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698658432] [2020-02-10 19:43:55,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:55,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256496463] [2020-02-10 19:43:55,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:55,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:55,911 INFO L87 Difference]: Start difference. First operand 435 states and 1491 transitions. Second operand 8 states. [2020-02-10 19:43:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,004 INFO L93 Difference]: Finished difference Result 881 states and 2738 transitions. [2020-02-10 19:43:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:56,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,006 INFO L225 Difference]: With dead ends: 881 [2020-02-10 19:43:56,007 INFO L226 Difference]: Without dead ends: 833 [2020-02-10 19:43:56,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2020-02-10 19:43:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 451. [2020-02-10 19:43:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2020-02-10 19:43:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1539 transitions. [2020-02-10 19:43:56,023 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1539 transitions. Word has length 19 [2020-02-10 19:43:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,023 INFO L479 AbstractCegarLoop]: Abstraction has 451 states and 1539 transitions. [2020-02-10 19:43:56,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1539 transitions. [2020-02-10 19:43:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:56,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,025 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2001069322, now seen corresponding path program 30 times [2020-02-10 19:43:56,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033443379] [2020-02-10 19:43:56,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,250 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,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033443379] [2020-02-10 19:43:56,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:56,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791513462] [2020-02-10 19:43:56,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:56,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:56,252 INFO L87 Difference]: Start difference. First operand 451 states and 1539 transitions. Second operand 8 states. [2020-02-10 19:43:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,337 INFO L93 Difference]: Finished difference Result 877 states and 2710 transitions. [2020-02-10 19:43:56,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:56,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,340 INFO L225 Difference]: With dead ends: 877 [2020-02-10 19:43:56,341 INFO L226 Difference]: Without dead ends: 806 [2020-02-10 19:43:56,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-02-10 19:43:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 424. [2020-02-10 19:43:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-02-10 19:43:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1461 transitions. [2020-02-10 19:43:56,355 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1461 transitions. Word has length 19 [2020-02-10 19:43:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,355 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 1461 transitions. [2020-02-10 19:43:56,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1461 transitions. [2020-02-10 19:43:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:56,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,357 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 784001922, now seen corresponding path program 31 times [2020-02-10 19:43:56,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821848567] [2020-02-10 19:43:56,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,569 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,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821848567] [2020-02-10 19:43:56,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:56,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385663277] [2020-02-10 19:43:56,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:56,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:56,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:56,571 INFO L87 Difference]: Start difference. First operand 424 states and 1461 transitions. Second operand 8 states. [2020-02-10 19:43:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,634 INFO L93 Difference]: Finished difference Result 837 states and 2562 transitions. [2020-02-10 19:43:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:56,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,638 INFO L225 Difference]: With dead ends: 837 [2020-02-10 19:43:56,638 INFO L226 Difference]: Without dead ends: 799 [2020-02-10 19:43:56,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2020-02-10 19:43:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 441. [2020-02-10 19:43:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-02-10 19:43:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1506 transitions. [2020-02-10 19:43:56,653 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1506 transitions. Word has length 19 [2020-02-10 19:43:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,654 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1506 transitions. [2020-02-10 19:43:56,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1506 transitions. [2020-02-10 19:43:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:56,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,656 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1158653108, now seen corresponding path program 32 times [2020-02-10 19:43:56,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113671926] [2020-02-10 19:43:56,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,885 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,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113671926] [2020-02-10 19:43:56,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:56,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522745321] [2020-02-10 19:43:56,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:56,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:56,887 INFO L87 Difference]: Start difference. First operand 441 states and 1506 transitions. Second operand 8 states. [2020-02-10 19:43:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,972 INFO L93 Difference]: Finished difference Result 847 states and 2589 transitions. [2020-02-10 19:43:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:56,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,975 INFO L225 Difference]: With dead ends: 847 [2020-02-10 19:43:56,975 INFO L226 Difference]: Without dead ends: 788 [2020-02-10 19:43:56,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2020-02-10 19:43:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 430. [2020-02-10 19:43:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-02-10 19:43:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-02-10 19:43:56,990 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-02-10 19:43:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,990 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-02-10 19:43:56,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-02-10 19:43:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:56,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,992 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash 988603004, now seen corresponding path program 33 times [2020-02-10 19:43:56,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798080000] [2020-02-10 19:43:56,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,190 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,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798080000] [2020-02-10 19:43:57,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:57,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965255423] [2020-02-10 19:43:57,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:57,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:57,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:57,192 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-02-10 19:43:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,264 INFO L93 Difference]: Finished difference Result 820 states and 2498 transitions. [2020-02-10 19:43:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:57,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,267 INFO L225 Difference]: With dead ends: 820 [2020-02-10 19:43:57,267 INFO L226 Difference]: Without dead ends: 782 [2020-02-10 19:43:57,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-02-10 19:43:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 435. [2020-02-10 19:43:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-02-10 19:43:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1485 transitions. [2020-02-10 19:43:57,283 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1485 transitions. Word has length 19 [2020-02-10 19:43:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,283 INFO L479 AbstractCegarLoop]: Abstraction has 435 states and 1485 transitions. [2020-02-10 19:43:57,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1485 transitions. [2020-02-10 19:43:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:57,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,286 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1865254260, now seen corresponding path program 1 times [2020-02-10 19:43:57,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559039161] [2020-02-10 19:43:57,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,297 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,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559039161] [2020-02-10 19:43:57,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:57,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114975717] [2020-02-10 19:43:57,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:57,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:57,299 INFO L87 Difference]: Start difference. First operand 435 states and 1485 transitions. Second operand 3 states. [2020-02-10 19:43:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,305 INFO L93 Difference]: Finished difference Result 349 states and 1112 transitions. [2020-02-10 19:43:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:57,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 19:43:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,306 INFO L225 Difference]: With dead ends: 349 [2020-02-10 19:43:57,306 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 19:43:57,307 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:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 19:43:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2020-02-10 19:43:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:43:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1112 transitions. [2020-02-10 19:43:57,317 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1112 transitions. Word has length 19 [2020-02-10 19:43:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,317 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1112 transitions. [2020-02-10 19:43:57,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1112 transitions. [2020-02-10 19:43:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:57,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,319 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1163123542, now seen corresponding path program 34 times [2020-02-10 19:43:57,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933829155] [2020-02-10 19:43:57,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,514 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,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933829155] [2020-02-10 19:43:57,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:57,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129693210] [2020-02-10 19:43:57,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:57,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:57,516 INFO L87 Difference]: Start difference. First operand 349 states and 1112 transitions. Second operand 8 states. [2020-02-10 19:43:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,593 INFO L93 Difference]: Finished difference Result 644 states and 1770 transitions. [2020-02-10 19:43:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:57,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,596 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:43:57,596 INFO L226 Difference]: Without dead ends: 611 [2020-02-10 19:43:57,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-02-10 19:43:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 346. [2020-02-10 19:43:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 19:43:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-02-10 19:43:57,607 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-02-10 19:43:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,608 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-02-10 19:43:57,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-02-10 19:43:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:57,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,609 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -409413030, now seen corresponding path program 35 times [2020-02-10 19:43:57,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230158187] [2020-02-10 19:43:57,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,821 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,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230158187] [2020-02-10 19:43:57,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:57,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752023518] [2020-02-10 19:43:57,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:57,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:57,823 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-02-10 19:43:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,908 INFO L93 Difference]: Finished difference Result 666 states and 1842 transitions. [2020-02-10 19:43:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:57,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,911 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:43:57,911 INFO L226 Difference]: Without dead ends: 626 [2020-02-10 19:43:57,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-02-10 19:43:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 352. [2020-02-10 19:43:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 19:43:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1117 transitions. [2020-02-10 19:43:57,920 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1117 transitions. Word has length 19 [2020-02-10 19:43:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,920 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1117 transitions. [2020-02-10 19:43:57,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1117 transitions. [2020-02-10 19:43:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:57,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,921 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1283748356, now seen corresponding path program 36 times [2020-02-10 19:43:57,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980977398] [2020-02-10 19:43:57,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,133 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,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980977398] [2020-02-10 19:43:58,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:58,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115727837] [2020-02-10 19:43:58,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:58,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:58,136 INFO L87 Difference]: Start difference. First operand 352 states and 1117 transitions. Second operand 8 states. [2020-02-10 19:43:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,220 INFO L93 Difference]: Finished difference Result 656 states and 1805 transitions. [2020-02-10 19:43:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:58,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,222 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:43:58,222 INFO L226 Difference]: Without dead ends: 616 [2020-02-10 19:43:58,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:58,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-02-10 19:43:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 342. [2020-02-10 19:43:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-02-10 19:43:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1096 transitions. [2020-02-10 19:43:58,236 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1096 transitions. Word has length 19 [2020-02-10 19:43:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,236 INFO L479 AbstractCegarLoop]: Abstraction has 342 states and 1096 transitions. [2020-02-10 19:43:58,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1096 transitions. [2020-02-10 19:43:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:58,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,238 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1043020286, now seen corresponding path program 37 times [2020-02-10 19:43:58,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113814644] [2020-02-10 19:43:58,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,427 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,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113814644] [2020-02-10 19:43:58,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:58,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080837865] [2020-02-10 19:43:58,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:58,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:58,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:58,429 INFO L87 Difference]: Start difference. First operand 342 states and 1096 transitions. Second operand 8 states. [2020-02-10 19:43:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,496 INFO L93 Difference]: Finished difference Result 637 states and 1753 transitions. [2020-02-10 19:43:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:58,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,498 INFO L225 Difference]: With dead ends: 637 [2020-02-10 19:43:58,498 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:43:58,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:43:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 348. [2020-02-10 19:43:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 19:43:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-02-10 19:43:58,508 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-02-10 19:43:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,509 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-02-10 19:43:58,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-02-10 19:43:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:58,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,510 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1100220464, now seen corresponding path program 38 times [2020-02-10 19:43:58,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370817231] [2020-02-10 19:43:58,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:58,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370817231] [2020-02-10 19:43:58,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:58,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151539574] [2020-02-10 19:43:58,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:58,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:58,716 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-02-10 19:43:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,805 INFO L93 Difference]: Finished difference Result 636 states and 1749 transitions. [2020-02-10 19:43:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:58,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,806 INFO L225 Difference]: With dead ends: 636 [2020-02-10 19:43:58,806 INFO L226 Difference]: Without dead ends: 603 [2020-02-10 19:43:58,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-02-10 19:43:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 345. [2020-02-10 19:43:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:43:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 19:43:58,815 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 19:43:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,815 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 19:43:58,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 19:43:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:58,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,816 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1549366552, now seen corresponding path program 39 times [2020-02-10 19:43:58,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112561562] [2020-02-10 19:43:58,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,992 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,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112561562] [2020-02-10 19:43:58,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:58,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451600015] [2020-02-10 19:43:58,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:58,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:58,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:58,994 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 19:43:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,063 INFO L93 Difference]: Finished difference Result 646 states and 1779 transitions. [2020-02-10 19:43:59,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:59,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,065 INFO L225 Difference]: With dead ends: 646 [2020-02-10 19:43:59,065 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:43:59,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:43:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 351. [2020-02-10 19:43:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 19:43:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1114 transitions. [2020-02-10 19:43:59,073 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1114 transitions. Word has length 19 [2020-02-10 19:43:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,074 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1114 transitions. [2020-02-10 19:43:59,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1114 transitions. [2020-02-10 19:43:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:59,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:59,075 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1769395994, now seen corresponding path program 40 times [2020-02-10 19:43:59,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297601894] [2020-02-10 19:43:59,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,277 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,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297601894] [2020-02-10 19:43:59,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:59,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333511796] [2020-02-10 19:43:59,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:59,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:59,279 INFO L87 Difference]: Start difference. First operand 351 states and 1114 transitions. Second operand 8 states. [2020-02-10 19:43:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,378 INFO L93 Difference]: Finished difference Result 651 states and 1791 transitions. [2020-02-10 19:43:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:59,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,380 INFO L225 Difference]: With dead ends: 651 [2020-02-10 19:43:59,380 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:43:59,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:43:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-02-10 19:43:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:43:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1100 transitions. [2020-02-10 19:43:59,391 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1100 transitions. Word has length 19 [2020-02-10 19:43:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,391 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1100 transitions. [2020-02-10 19:43:59,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1100 transitions. [2020-02-10 19:43:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:59,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:59,393 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1215861966, now seen corresponding path program 41 times [2020-02-10 19:43:59,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039415740] [2020-02-10 19:43:59,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,620 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,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039415740] [2020-02-10 19:43:59,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:59,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632408928] [2020-02-10 19:43:59,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:59,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:59,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:59,622 INFO L87 Difference]: Start difference. First operand 345 states and 1100 transitions. Second operand 8 states. [2020-02-10 19:43:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,720 INFO L93 Difference]: Finished difference Result 643 states and 1772 transitions. [2020-02-10 19:43:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:43:59,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:43:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,722 INFO L225 Difference]: With dead ends: 643 [2020-02-10 19:43:59,722 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:43:59,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:43:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:43:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 350. [2020-02-10 19:43:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 19:43:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1110 transitions. [2020-02-10 19:43:59,732 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1110 transitions. Word has length 19 [2020-02-10 19:43:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,732 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1110 transitions. [2020-02-10 19:43:59,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:43:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1110 transitions. [2020-02-10 19:43:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:43:59,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:59,733 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash -513185368, now seen corresponding path program 42 times [2020-02-10 19:43:59,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372190123] [2020-02-10 19:43:59,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,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:43:59,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372190123] [2020-02-10 19:43:59,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:43:59,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003715234] [2020-02-10 19:43:59,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:43:59,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:43:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:43:59,954 INFO L87 Difference]: Start difference. First operand 350 states and 1110 transitions. Second operand 8 states. [2020-02-10 19:44:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,044 INFO L93 Difference]: Finished difference Result 649 states and 1786 transitions. [2020-02-10 19:44:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:00,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,046 INFO L225 Difference]: With dead ends: 649 [2020-02-10 19:44:00,046 INFO L226 Difference]: Without dead ends: 605 [2020-02-10 19:44:00,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-02-10 19:44:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 342. [2020-02-10 19:44:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-02-10 19:44:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1093 transitions. [2020-02-10 19:44:00,055 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1093 transitions. Word has length 19 [2020-02-10 19:44:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,055 INFO L479 AbstractCegarLoop]: Abstraction has 342 states and 1093 transitions. [2020-02-10 19:44:00,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1093 transitions. [2020-02-10 19:44:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:00,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,056 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1822419634, now seen corresponding path program 43 times [2020-02-10 19:44:00,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927659400] [2020-02-10 19:44:00,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,269 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,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927659400] [2020-02-10 19:44:00,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:00,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436996730] [2020-02-10 19:44:00,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:00,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:00,271 INFO L87 Difference]: Start difference. First operand 342 states and 1093 transitions. Second operand 8 states. [2020-02-10 19:44:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,361 INFO L93 Difference]: Finished difference Result 678 states and 1898 transitions. [2020-02-10 19:44:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:00,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,363 INFO L225 Difference]: With dead ends: 678 [2020-02-10 19:44:00,363 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:44:00,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:44:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 353. [2020-02-10 19:44:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 19:44:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1125 transitions. [2020-02-10 19:44:00,372 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1125 transitions. Word has length 19 [2020-02-10 19:44:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,372 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1125 transitions. [2020-02-10 19:44:00,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1125 transitions. [2020-02-10 19:44:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:00,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,373 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1598212336, now seen corresponding path program 44 times [2020-02-10 19:44:00,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508215342] [2020-02-10 19:44:00,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,645 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,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508215342] [2020-02-10 19:44:00,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:00,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383995218] [2020-02-10 19:44:00,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:00,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:00,647 INFO L87 Difference]: Start difference. First operand 353 states and 1125 transitions. Second operand 8 states. [2020-02-10 19:44:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,727 INFO L93 Difference]: Finished difference Result 668 states and 1861 transitions. [2020-02-10 19:44:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:00,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,729 INFO L225 Difference]: With dead ends: 668 [2020-02-10 19:44:00,729 INFO L226 Difference]: Without dead ends: 632 [2020-02-10 19:44:00,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-02-10 19:44:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 347. [2020-02-10 19:44:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1108 transitions. [2020-02-10 19:44:00,740 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1108 transitions. Word has length 19 [2020-02-10 19:44:00,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,741 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1108 transitions. [2020-02-10 19:44:00,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1108 transitions. [2020-02-10 19:44:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:00,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,742 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:00,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash 411687860, now seen corresponding path program 45 times [2020-02-10 19:44:00,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310304636] [2020-02-10 19:44:00,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,982 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,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310304636] [2020-02-10 19:44:00,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:00,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544722823] [2020-02-10 19:44:00,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:00,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:00,984 INFO L87 Difference]: Start difference. First operand 347 states and 1108 transitions. Second operand 8 states. [2020-02-10 19:44:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,065 INFO L93 Difference]: Finished difference Result 690 states and 1937 transitions. [2020-02-10 19:44:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:01,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,067 INFO L225 Difference]: With dead ends: 690 [2020-02-10 19:44:01,067 INFO L226 Difference]: Without dead ends: 650 [2020-02-10 19:44:01,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-02-10 19:44:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 359. [2020-02-10 19:44:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-02-10 19:44:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1139 transitions. [2020-02-10 19:44:01,079 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1139 transitions. Word has length 19 [2020-02-10 19:44:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,080 INFO L479 AbstractCegarLoop]: Abstraction has 359 states and 1139 transitions. [2020-02-10 19:44:01,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1139 transitions. [2020-02-10 19:44:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:01,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,081 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1380571900, now seen corresponding path program 46 times [2020-02-10 19:44:01,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841140622] [2020-02-10 19:44:01,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,290 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,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841140622] [2020-02-10 19:44:01,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:01,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160832825] [2020-02-10 19:44:01,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:01,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:01,292 INFO L87 Difference]: Start difference. First operand 359 states and 1139 transitions. Second operand 8 states. [2020-02-10 19:44:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,389 INFO L93 Difference]: Finished difference Result 686 states and 1913 transitions. [2020-02-10 19:44:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:01,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,391 INFO L225 Difference]: With dead ends: 686 [2020-02-10 19:44:01,391 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:44:01,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:44:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 347. [2020-02-10 19:44:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-02-10 19:44:01,399 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-02-10 19:44:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,400 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-02-10 19:44:01,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-02-10 19:44:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:01,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,401 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1771460028, now seen corresponding path program 47 times [2020-02-10 19:44:01,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528586539] [2020-02-10 19:44:01,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,596 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,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528586539] [2020-02-10 19:44:01,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:01,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001242756] [2020-02-10 19:44:01,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:01,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:01,598 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-02-10 19:44:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,699 INFO L93 Difference]: Finished difference Result 663 states and 1842 transitions. [2020-02-10 19:44:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:01,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,701 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:44:01,701 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:44:01,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:44:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 352. [2020-02-10 19:44:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 19:44:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1113 transitions. [2020-02-10 19:44:01,710 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1113 transitions. Word has length 19 [2020-02-10 19:44:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,710 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1113 transitions. [2020-02-10 19:44:01,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1113 transitions. [2020-02-10 19:44:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:01,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,711 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,712 INFO L82 PathProgramCache]: Analyzing trace with hash 42412694, now seen corresponding path program 48 times [2020-02-10 19:44:01,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992799255] [2020-02-10 19:44:01,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,904 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,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992799255] [2020-02-10 19:44:01,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:01,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415377176] [2020-02-10 19:44:01,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:01,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:01,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:01,907 INFO L87 Difference]: Start difference. First operand 352 states and 1113 transitions. Second operand 8 states. [2020-02-10 19:44:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,007 INFO L93 Difference]: Finished difference Result 669 states and 1856 transitions. [2020-02-10 19:44:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:02,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,010 INFO L225 Difference]: With dead ends: 669 [2020-02-10 19:44:02,010 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:44:02,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:44:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 337. [2020-02-10 19:44:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 19:44:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1082 transitions. [2020-02-10 19:44:02,019 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1082 transitions. Word has length 19 [2020-02-10 19:44:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,020 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1082 transitions. [2020-02-10 19:44:02,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1082 transitions. [2020-02-10 19:44:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:02,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,021 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1950102064, now seen corresponding path program 49 times [2020-02-10 19:44:02,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386346824] [2020-02-10 19:44:02,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,284 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,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386346824] [2020-02-10 19:44:02,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:02,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034437449] [2020-02-10 19:44:02,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:02,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:02,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:02,286 INFO L87 Difference]: Start difference. First operand 337 states and 1082 transitions. Second operand 8 states. [2020-02-10 19:44:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,348 INFO L93 Difference]: Finished difference Result 648 states and 1785 transitions. [2020-02-10 19:44:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:02,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,350 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:44:02,350 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:02,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 353. [2020-02-10 19:44:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 19:44:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1124 transitions. [2020-02-10 19:44:02,361 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1124 transitions. Word has length 19 [2020-02-10 19:44:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,361 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1124 transitions. [2020-02-10 19:44:02,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1124 transitions. [2020-02-10 19:44:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:02,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,362 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1575450878, now seen corresponding path program 50 times [2020-02-10 19:44:02,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229878494] [2020-02-10 19:44:02,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,579 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,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229878494] [2020-02-10 19:44:02,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:02,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697273291] [2020-02-10 19:44:02,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:02,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:02,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:02,581 INFO L87 Difference]: Start difference. First operand 353 states and 1124 transitions. Second operand 8 states. [2020-02-10 19:44:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,671 INFO L93 Difference]: Finished difference Result 657 states and 1808 transitions. [2020-02-10 19:44:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:02,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,674 INFO L225 Difference]: With dead ends: 657 [2020-02-10 19:44:02,674 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:44:02,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:44:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-02-10 19:44:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1106 transitions. [2020-02-10 19:44:02,684 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1106 transitions. Word has length 19 [2020-02-10 19:44:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,684 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1106 transitions. [2020-02-10 19:44:02,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1106 transitions. [2020-02-10 19:44:02,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:02,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,685 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1745500982, now seen corresponding path program 51 times [2020-02-10 19:44:02,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841095314] [2020-02-10 19:44:02,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,916 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,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841095314] [2020-02-10 19:44:02,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:02,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973843402] [2020-02-10 19:44:02,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:02,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:02,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:02,918 INFO L87 Difference]: Start difference. First operand 345 states and 1106 transitions. Second operand 8 states. [2020-02-10 19:44:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,988 INFO L93 Difference]: Finished difference Result 633 states and 1736 transitions. [2020-02-10 19:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:02,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,989 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:44:02,990 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:44:02,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:44:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 348. [2020-02-10 19:44:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 19:44:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-02-10 19:44:02,999 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-02-10 19:44:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,999 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-02-10 19:44:03,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-02-10 19:44:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:03,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,001 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash 397739768, now seen corresponding path program 52 times [2020-02-10 19:44:03,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100898542] [2020-02-10 19:44:03,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:03,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100898542] [2020-02-10 19:44:03,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:03,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720408828] [2020-02-10 19:44:03,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:03,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:03,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:03,212 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-02-10 19:44:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,306 INFO L93 Difference]: Finished difference Result 632 states and 1732 transitions. [2020-02-10 19:44:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:03,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,308 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:44:03,308 INFO L226 Difference]: Without dead ends: 599 [2020-02-10 19:44:03,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-02-10 19:44:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 345. [2020-02-10 19:44:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 19:44:03,319 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 19:44:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,319 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 19:44:03,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 19:44:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:03,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,320 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1151450280, now seen corresponding path program 53 times [2020-02-10 19:44:03,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11214996] [2020-02-10 19:44:03,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:03,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11214996] [2020-02-10 19:44:03,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:03,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310530379] [2020-02-10 19:44:03,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:03,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:03,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:03,538 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 19:44:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,619 INFO L93 Difference]: Finished difference Result 654 states and 1804 transitions. [2020-02-10 19:44:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:03,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,620 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:44:03,620 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:44:03,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:44:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 351. [2020-02-10 19:44:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 19:44:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-02-10 19:44:03,629 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-02-10 19:44:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,629 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-02-10 19:44:03,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-02-10 19:44:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:03,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,630 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash 277114954, now seen corresponding path program 54 times [2020-02-10 19:44:03,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989360286] [2020-02-10 19:44:03,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,834 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,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989360286] [2020-02-10 19:44:03,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:03,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405355554] [2020-02-10 19:44:03,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:03,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:03,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:03,835 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-02-10 19:44:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,929 INFO L93 Difference]: Finished difference Result 644 states and 1767 transitions. [2020-02-10 19:44:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:03,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,931 INFO L225 Difference]: With dead ends: 644 [2020-02-10 19:44:03,931 INFO L226 Difference]: Without dead ends: 604 [2020-02-10 19:44:03,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-02-10 19:44:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 341. [2020-02-10 19:44:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1094 transitions. [2020-02-10 19:44:03,939 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1094 transitions. Word has length 19 [2020-02-10 19:44:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,940 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1094 transitions. [2020-02-10 19:44:03,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1094 transitions. [2020-02-10 19:44:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:03,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,941 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1499893780, now seen corresponding path program 55 times [2020-02-10 19:44:03,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362504193] [2020-02-10 19:44:03,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,156 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,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362504193] [2020-02-10 19:44:04,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:04,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552450464] [2020-02-10 19:44:04,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:04,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:04,158 INFO L87 Difference]: Start difference. First operand 341 states and 1094 transitions. Second operand 8 states. [2020-02-10 19:44:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,225 INFO L93 Difference]: Finished difference Result 658 states and 1820 transitions. [2020-02-10 19:44:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:04,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,226 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:44:04,227 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:44:04,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:44:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 355. [2020-02-10 19:44:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-02-10 19:44:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2020-02-10 19:44:04,234 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 19 [2020-02-10 19:44:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,235 INFO L479 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2020-02-10 19:44:04,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2020-02-10 19:44:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:04,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,236 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1874544966, now seen corresponding path program 56 times [2020-02-10 19:44:04,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893791363] [2020-02-10 19:44:04,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,456 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,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893791363] [2020-02-10 19:44:04,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:04,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422610274] [2020-02-10 19:44:04,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:04,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:04,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:04,458 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand 8 states. [2020-02-10 19:44:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,545 INFO L93 Difference]: Finished difference Result 667 states and 1843 transitions. [2020-02-10 19:44:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:04,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,547 INFO L225 Difference]: With dead ends: 667 [2020-02-10 19:44:04,547 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:44:04,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:44:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 347. [2020-02-10 19:44:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1109 transitions. [2020-02-10 19:44:04,555 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1109 transitions. Word has length 19 [2020-02-10 19:44:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,556 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1109 transitions. [2020-02-10 19:44:04,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1109 transitions. [2020-02-10 19:44:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:04,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,557 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:04,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1939279986, now seen corresponding path program 57 times [2020-02-10 19:44:04,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344307598] [2020-02-10 19:44:04,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,807 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,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344307598] [2020-02-10 19:44:04,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:04,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159845090] [2020-02-10 19:44:04,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:04,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:04,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:04,808 INFO L87 Difference]: Start difference. First operand 347 states and 1109 transitions. Second operand 8 states. [2020-02-10 19:44:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,880 INFO L93 Difference]: Finished difference Result 648 states and 1786 transitions. [2020-02-10 19:44:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:04,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,882 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:44:04,882 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:04,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 352. [2020-02-10 19:44:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 19:44:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1118 transitions. [2020-02-10 19:44:04,893 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1118 transitions. Word has length 19 [2020-02-10 19:44:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,893 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1118 transitions. [2020-02-10 19:44:04,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1118 transitions. [2020-02-10 19:44:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:04,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,895 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1604625216, now seen corresponding path program 58 times [2020-02-10 19:44:04,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319547433] [2020-02-10 19:44:04,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,140 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,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319547433] [2020-02-10 19:44:05,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:05,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559217861] [2020-02-10 19:44:05,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:05,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:05,141 INFO L87 Difference]: Start difference. First operand 352 states and 1118 transitions. Second operand 8 states. [2020-02-10 19:44:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,222 INFO L93 Difference]: Finished difference Result 650 states and 1790 transitions. [2020-02-10 19:44:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:05,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,224 INFO L225 Difference]: With dead ends: 650 [2020-02-10 19:44:05,224 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:44:05,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:44:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 347. [2020-02-10 19:44:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-02-10 19:44:05,235 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-02-10 19:44:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,235 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-02-10 19:44:05,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-02-10 19:44:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:05,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,236 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:05,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,237 INFO L82 PathProgramCache]: Analyzing trace with hash 334504740, now seen corresponding path program 59 times [2020-02-10 19:44:05,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833923485] [2020-02-10 19:44:05,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,429 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,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833923485] [2020-02-10 19:44:05,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:05,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135930692] [2020-02-10 19:44:05,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:05,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:05,432 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-02-10 19:44:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,529 INFO L93 Difference]: Finished difference Result 670 states and 1858 transitions. [2020-02-10 19:44:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:05,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,531 INFO L225 Difference]: With dead ends: 670 [2020-02-10 19:44:05,531 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:44:05,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:44:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 356. [2020-02-10 19:44:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-02-10 19:44:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1126 transitions. [2020-02-10 19:44:05,538 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1126 transitions. Word has length 19 [2020-02-10 19:44:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,538 INFO L479 AbstractCegarLoop]: Abstraction has 356 states and 1126 transitions. [2020-02-10 19:44:05,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1126 transitions. [2020-02-10 19:44:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:05,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,539 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash 333910094, now seen corresponding path program 60 times [2020-02-10 19:44:05,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914086058] [2020-02-10 19:44:05,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,737 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,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914086058] [2020-02-10 19:44:05,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:05,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892825796] [2020-02-10 19:44:05,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:05,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:05,739 INFO L87 Difference]: Start difference. First operand 356 states and 1126 transitions. Second operand 8 states. [2020-02-10 19:44:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,843 INFO L93 Difference]: Finished difference Result 663 states and 1828 transitions. [2020-02-10 19:44:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:05,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,845 INFO L225 Difference]: With dead ends: 663 [2020-02-10 19:44:05,845 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:44:05,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:44:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 341. [2020-02-10 19:44:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1090 transitions. [2020-02-10 19:44:05,853 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1090 transitions. Word has length 19 [2020-02-10 19:44:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,853 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1090 transitions. [2020-02-10 19:44:05,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1090 transitions. [2020-02-10 19:44:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:05,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,855 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash -985705328, now seen corresponding path program 61 times [2020-02-10 19:44:05,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486022833] [2020-02-10 19:44:05,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,077 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,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486022833] [2020-02-10 19:44:06,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:06,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453859427] [2020-02-10 19:44:06,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:06,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:06,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:06,080 INFO L87 Difference]: Start difference. First operand 341 states and 1090 transitions. Second operand 8 states. [2020-02-10 19:44:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,147 INFO L93 Difference]: Finished difference Result 620 states and 1696 transitions. [2020-02-10 19:44:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:06,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,149 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:44:06,149 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:44:06,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:44:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 347. [2020-02-10 19:44:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-02-10 19:44:06,157 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-02-10 19:44:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,157 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-02-10 19:44:06,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-02-10 19:44:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:06,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,159 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1157535422, now seen corresponding path program 62 times [2020-02-10 19:44:06,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092285105] [2020-02-10 19:44:06,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,377 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,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092285105] [2020-02-10 19:44:06,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:06,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039983394] [2020-02-10 19:44:06,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:06,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:06,378 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-02-10 19:44:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,472 INFO L93 Difference]: Finished difference Result 619 states and 1692 transitions. [2020-02-10 19:44:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:06,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,475 INFO L225 Difference]: With dead ends: 619 [2020-02-10 19:44:06,475 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:44:06,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:44:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 344. [2020-02-10 19:44:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 19:44:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1097 transitions. [2020-02-10 19:44:06,488 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1097 transitions. Word has length 19 [2020-02-10 19:44:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,489 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1097 transitions. [2020-02-10 19:44:06,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1097 transitions. [2020-02-10 19:44:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:06,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,490 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash 108386260, now seen corresponding path program 63 times [2020-02-10 19:44:06,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322168670] [2020-02-10 19:44:06,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:06,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322168670] [2020-02-10 19:44:06,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:06,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860894484] [2020-02-10 19:44:06,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:06,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:06,705 INFO L87 Difference]: Start difference. First operand 344 states and 1097 transitions. Second operand 8 states. [2020-02-10 19:44:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,778 INFO L93 Difference]: Finished difference Result 625 states and 1710 transitions. [2020-02-10 19:44:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:06,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,780 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:44:06,780 INFO L226 Difference]: Without dead ends: 594 [2020-02-10 19:44:06,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-02-10 19:44:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 349. [2020-02-10 19:44:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-02-10 19:44:06,789 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-02-10 19:44:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,789 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-02-10 19:44:06,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-02-10 19:44:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:06,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,790 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash -642675834, now seen corresponding path program 64 times [2020-02-10 19:44:06,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107563230] [2020-02-10 19:44:06,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,997 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,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107563230] [2020-02-10 19:44:06,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:06,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895559460] [2020-02-10 19:44:06,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:06,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:07,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:07,000 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-02-10 19:44:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,104 INFO L93 Difference]: Finished difference Result 627 states and 1714 transitions. [2020-02-10 19:44:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:07,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,106 INFO L225 Difference]: With dead ends: 627 [2020-02-10 19:44:07,106 INFO L226 Difference]: Without dead ends: 589 [2020-02-10 19:44:07,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-02-10 19:44:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 344. [2020-02-10 19:44:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 19:44:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-02-10 19:44:07,114 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-02-10 19:44:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,114 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-02-10 19:44:07,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-02-10 19:44:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:07,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,115 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,116 INFO L82 PathProgramCache]: Analyzing trace with hash 517971322, now seen corresponding path program 65 times [2020-02-10 19:44:07,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397240724] [2020-02-10 19:44:07,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,346 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,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397240724] [2020-02-10 19:44:07,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:07,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074113402] [2020-02-10 19:44:07,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:07,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:07,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:07,347 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-02-10 19:44:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,439 INFO L93 Difference]: Finished difference Result 622 states and 1703 transitions. [2020-02-10 19:44:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:07,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,441 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:44:07,441 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:44:07,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:44:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-02-10 19:44:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 19:44:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-02-10 19:44:07,448 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-02-10 19:44:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,448 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-02-10 19:44:07,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-02-10 19:44:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:07,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,449 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2066382666, now seen corresponding path program 66 times [2020-02-10 19:44:07,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679858494] [2020-02-10 19:44:07,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,659 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,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679858494] [2020-02-10 19:44:07,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:07,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576303224] [2020-02-10 19:44:07,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:07,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:07,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:07,660 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-02-10 19:44:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,752 INFO L93 Difference]: Finished difference Result 625 states and 1709 transitions. [2020-02-10 19:44:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:07,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,754 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:44:07,754 INFO L226 Difference]: Without dead ends: 585 [2020-02-10 19:44:07,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-02-10 19:44:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 341. [2020-02-10 19:44:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-02-10 19:44:07,762 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-02-10 19:44:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,763 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-02-10 19:44:07,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-02-10 19:44:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:07,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,764 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1775607780, now seen corresponding path program 67 times [2020-02-10 19:44:07,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017752411] [2020-02-10 19:44:07,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,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:44:07,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017752411] [2020-02-10 19:44:07,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:07,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095469290] [2020-02-10 19:44:07,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:07,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:07,978 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-02-10 19:44:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,061 INFO L93 Difference]: Finished difference Result 658 states and 1828 transitions. [2020-02-10 19:44:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:08,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,063 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:44:08,063 INFO L226 Difference]: Without dead ends: 618 [2020-02-10 19:44:08,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-02-10 19:44:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 351. [2020-02-10 19:44:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 19:44:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-02-10 19:44:08,071 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-02-10 19:44:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,071 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-02-10 19:44:08,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-02-10 19:44:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:08,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,072 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1645024190, now seen corresponding path program 68 times [2020-02-10 19:44:08,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117076078] [2020-02-10 19:44:08,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:08,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117076078] [2020-02-10 19:44:08,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:08,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126316552] [2020-02-10 19:44:08,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:08,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:08,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:08,296 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-02-10 19:44:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,378 INFO L93 Difference]: Finished difference Result 648 states and 1791 transitions. [2020-02-10 19:44:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:08,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,380 INFO L225 Difference]: With dead ends: 648 [2020-02-10 19:44:08,380 INFO L226 Difference]: Without dead ends: 612 [2020-02-10 19:44:08,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-02-10 19:44:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 345. [2020-02-10 19:44:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-02-10 19:44:08,388 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-02-10 19:44:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,388 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-02-10 19:44:08,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-02-10 19:44:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:08,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,389 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash -286202784, now seen corresponding path program 69 times [2020-02-10 19:44:08,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807391508] [2020-02-10 19:44:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,597 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,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807391508] [2020-02-10 19:44:08,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:08,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773054071] [2020-02-10 19:44:08,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:08,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:08,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:08,598 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-02-10 19:44:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,686 INFO L93 Difference]: Finished difference Result 664 states and 1847 transitions. [2020-02-10 19:44:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:08,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,688 INFO L225 Difference]: With dead ends: 664 [2020-02-10 19:44:08,688 INFO L226 Difference]: Without dead ends: 624 [2020-02-10 19:44:08,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-02-10 19:44:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 354. [2020-02-10 19:44:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-02-10 19:44:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1121 transitions. [2020-02-10 19:44:08,696 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1121 transitions. Word has length 19 [2020-02-10 19:44:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,696 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 1121 transitions. [2020-02-10 19:44:08,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1121 transitions. [2020-02-10 19:44:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:08,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,697 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1031499928, now seen corresponding path program 70 times [2020-02-10 19:44:08,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639850930] [2020-02-10 19:44:08,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,901 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,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639850930] [2020-02-10 19:44:08,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:08,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584785945] [2020-02-10 19:44:08,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:08,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:08,903 INFO L87 Difference]: Start difference. First operand 354 states and 1121 transitions. Second operand 8 states. [2020-02-10 19:44:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,991 INFO L93 Difference]: Finished difference Result 657 states and 1817 transitions. [2020-02-10 19:44:08,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:08,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,993 INFO L225 Difference]: With dead ends: 657 [2020-02-10 19:44:08,993 INFO L226 Difference]: Without dead ends: 615 [2020-02-10 19:44:08,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-02-10 19:44:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 345. [2020-02-10 19:44:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-02-10 19:44:09,000 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-02-10 19:44:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,000 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-02-10 19:44:09,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-02-10 19:44:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:09,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,001 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1073569384, now seen corresponding path program 71 times [2020-02-10 19:44:09,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921401058] [2020-02-10 19:44:09,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,205 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,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921401058] [2020-02-10 19:44:09,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:09,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238704860] [2020-02-10 19:44:09,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:09,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:09,206 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-02-10 19:44:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,287 INFO L93 Difference]: Finished difference Result 639 states and 1762 transitions. [2020-02-10 19:44:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:09,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,289 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:44:09,289 INFO L226 Difference]: Without dead ends: 609 [2020-02-10 19:44:09,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-02-10 19:44:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 349. [2020-02-10 19:44:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1103 transitions. [2020-02-10 19:44:09,297 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1103 transitions. Word has length 19 [2020-02-10 19:44:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,298 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1103 transitions. [2020-02-10 19:44:09,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1103 transitions. [2020-02-10 19:44:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:09,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,298 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1510784604, now seen corresponding path program 72 times [2020-02-10 19:44:09,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678826682] [2020-02-10 19:44:09,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,498 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,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678826682] [2020-02-10 19:44:09,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:09,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003974393] [2020-02-10 19:44:09,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:09,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:09,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:09,500 INFO L87 Difference]: Start difference. First operand 349 states and 1103 transitions. Second operand 8 states. [2020-02-10 19:44:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,578 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-02-10 19:44:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:09,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,580 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:44:09,580 INFO L226 Difference]: Without dead ends: 597 [2020-02-10 19:44:09,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-02-10 19:44:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2020-02-10 19:44:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 19:44:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1078 transitions. [2020-02-10 19:44:09,587 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1078 transitions. Word has length 19 [2020-02-10 19:44:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,588 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1078 transitions. [2020-02-10 19:44:09,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1078 transitions. [2020-02-10 19:44:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:09,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,589 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash 458482122, now seen corresponding path program 73 times [2020-02-10 19:44:09,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703305871] [2020-02-10 19:44:09,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:09,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703305871] [2020-02-10 19:44:09,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:09,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681712928] [2020-02-10 19:44:09,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:09,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:09,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:09,805 INFO L87 Difference]: Start difference. First operand 337 states and 1078 transitions. Second operand 8 states. [2020-02-10 19:44:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,868 INFO L93 Difference]: Finished difference Result 609 states and 1671 transitions. [2020-02-10 19:44:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:09,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,870 INFO L225 Difference]: With dead ends: 609 [2020-02-10 19:44:09,870 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:44:09,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:44:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 346. [2020-02-10 19:44:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 19:44:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-02-10 19:44:09,877 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-02-10 19:44:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,877 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-02-10 19:44:09,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-02-10 19:44:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:09,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,878 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1693244424, now seen corresponding path program 74 times [2020-02-10 19:44:09,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019960566] [2020-02-10 19:44:09,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:10,085 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:10,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019960566] [2020-02-10 19:44:10,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:10,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:10,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686087396] [2020-02-10 19:44:10,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:10,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:10,087 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-02-10 19:44:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:10,164 INFO L93 Difference]: Finished difference Result 608 states and 1667 transitions. [2020-02-10 19:44:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:10,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:10,166 INFO L225 Difference]: With dead ends: 608 [2020-02-10 19:44:10,166 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:44:10,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:44:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 343. [2020-02-10 19:44:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 19:44:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1098 transitions. [2020-02-10 19:44:10,174 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1098 transitions. Word has length 19 [2020-02-10 19:44:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,174 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1098 transitions. [2020-02-10 19:44:10,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1098 transitions. [2020-02-10 19:44:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:10,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:10,175 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1552573710, now seen corresponding path program 75 times [2020-02-10 19:44:10,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702648922] [2020-02-10 19:44:10,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:10,373 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:10,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702648922] [2020-02-10 19:44:10,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:10,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:10,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711160763] [2020-02-10 19:44:10,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:10,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:10,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:10,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:10,375 INFO L87 Difference]: Start difference. First operand 343 states and 1098 transitions. Second operand 8 states. [2020-02-10 19:44:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:10,451 INFO L93 Difference]: Finished difference Result 614 states and 1685 transitions. [2020-02-10 19:44:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:10,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:10,454 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:44:10,454 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:44:10,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:44:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 348. [2020-02-10 19:44:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 19:44:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1107 transitions. [2020-02-10 19:44:10,469 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1107 transitions. Word has length 19 [2020-02-10 19:44:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,470 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1107 transitions. [2020-02-10 19:44:10,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1107 transitions. [2020-02-10 19:44:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:10,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:10,472 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 801511616, now seen corresponding path program 76 times [2020-02-10 19:44:10,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126350743] [2020-02-10 19:44:10,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:10,771 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2020-02-10 19:44:10,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:44:10,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126350743] [2020-02-10 19:44:10,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:10,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:10,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825838020] [2020-02-10 19:44:10,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:10,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:10,861 INFO L87 Difference]: Start difference. First operand 348 states and 1107 transitions. Second operand 8 states. [2020-02-10 19:44:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:10,968 INFO L93 Difference]: Finished difference Result 616 states and 1689 transitions. [2020-02-10 19:44:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:10,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:10,970 INFO L225 Difference]: With dead ends: 616 [2020-02-10 19:44:10,970 INFO L226 Difference]: Without dead ends: 578 [2020-02-10 19:44:10,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-02-10 19:44:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 343. [2020-02-10 19:44:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 19:44:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-02-10 19:44:10,980 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-02-10 19:44:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,980 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-02-10 19:44:10,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-02-10 19:44:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:10,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:10,982 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158772, now seen corresponding path program 77 times [2020-02-10 19:44:10,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232380757] [2020-02-10 19:44:10,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,182 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:11,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232380757] [2020-02-10 19:44:11,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:11,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827199461] [2020-02-10 19:44:11,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:11,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:11,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:11,184 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-02-10 19:44:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,266 INFO L93 Difference]: Finished difference Result 611 states and 1678 transitions. [2020-02-10 19:44:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:11,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,268 INFO L225 Difference]: With dead ends: 611 [2020-02-10 19:44:11,268 INFO L226 Difference]: Without dead ends: 581 [2020-02-10 19:44:11,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-02-10 19:44:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 347. [2020-02-10 19:44:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-02-10 19:44:11,277 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-02-10 19:44:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,277 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-02-10 19:44:11,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-02-10 19:44:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:11,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:11,278 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash -622195216, now seen corresponding path program 78 times [2020-02-10 19:44:11,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756115469] [2020-02-10 19:44:11,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,497 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:11,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756115469] [2020-02-10 19:44:11,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:11,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956815293] [2020-02-10 19:44:11,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:11,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:11,499 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-02-10 19:44:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,588 INFO L93 Difference]: Finished difference Result 614 states and 1684 transitions. [2020-02-10 19:44:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:11,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,590 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:44:11,590 INFO L226 Difference]: Without dead ends: 574 [2020-02-10 19:44:11,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-02-10 19:44:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 340. [2020-02-10 19:44:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 19:44:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1088 transitions. [2020-02-10 19:44:11,599 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1088 transitions. Word has length 19 [2020-02-10 19:44:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,599 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1088 transitions. [2020-02-10 19:44:11,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1088 transitions. [2020-02-10 19:44:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:11,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:11,600 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:11,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1910451096, now seen corresponding path program 79 times [2020-02-10 19:44:11,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018354015] [2020-02-10 19:44:11,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,807 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:11,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018354015] [2020-02-10 19:44:11,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:11,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569646953] [2020-02-10 19:44:11,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:11,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:11,809 INFO L87 Difference]: Start difference. First operand 340 states and 1088 transitions. Second operand 8 states. [2020-02-10 19:44:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,885 INFO L93 Difference]: Finished difference Result 614 states and 1683 transitions. [2020-02-10 19:44:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:11,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,886 INFO L225 Difference]: With dead ends: 614 [2020-02-10 19:44:11,887 INFO L226 Difference]: Without dead ends: 583 [2020-02-10 19:44:11,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-02-10 19:44:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 346. [2020-02-10 19:44:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 19:44:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1102 transitions. [2020-02-10 19:44:11,894 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1102 transitions. Word has length 19 [2020-02-10 19:44:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,894 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1102 transitions. [2020-02-10 19:44:11,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1102 transitions. [2020-02-10 19:44:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:11,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:11,895 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash 232789654, now seen corresponding path program 80 times [2020-02-10 19:44:11,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320039493] [2020-02-10 19:44:11,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:12,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:44:12,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320039493] [2020-02-10 19:44:12,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:12,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:12,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992970975] [2020-02-10 19:44:12,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:12,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:12,090 INFO L87 Difference]: Start difference. First operand 346 states and 1102 transitions. Second operand 8 states. [2020-02-10 19:44:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:12,176 INFO L93 Difference]: Finished difference Result 613 states and 1679 transitions. [2020-02-10 19:44:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:12,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:12,178 INFO L225 Difference]: With dead ends: 613 [2020-02-10 19:44:12,178 INFO L226 Difference]: Without dead ends: 580 [2020-02-10 19:44:12,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-02-10 19:44:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 343. [2020-02-10 19:44:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 19:44:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-02-10 19:44:12,186 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-02-10 19:44:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:12,186 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-02-10 19:44:12,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-02-10 19:44:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:12,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:12,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:12,187 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1878169934, now seen corresponding path program 81 times [2020-02-10 19:44:12,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:12,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047431176] [2020-02-10 19:44:12,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:12,398 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:12,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047431176] [2020-02-10 19:44:12,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:12,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:12,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447548320] [2020-02-10 19:44:12,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:12,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:12,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:12,399 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-02-10 19:44:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:12,481 INFO L93 Difference]: Finished difference Result 623 states and 1709 transitions. [2020-02-10 19:44:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:12,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:12,483 INFO L225 Difference]: With dead ends: 623 [2020-02-10 19:44:12,483 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:44:12,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:44:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 349. [2020-02-10 19:44:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-02-10 19:44:12,493 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-02-10 19:44:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:12,494 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-02-10 19:44:12,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-02-10 19:44:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:12,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:12,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:12,495 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:12,496 INFO L82 PathProgramCache]: Analyzing trace with hash 901965184, now seen corresponding path program 82 times [2020-02-10 19:44:12,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:12,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116636273] [2020-02-10 19:44:12,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:12,744 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:12,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116636273] [2020-02-10 19:44:12,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:12,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:12,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814662249] [2020-02-10 19:44:12,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:12,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:12,746 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-02-10 19:44:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:12,842 INFO L93 Difference]: Finished difference Result 628 states and 1721 transitions. [2020-02-10 19:44:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:12,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:12,843 INFO L225 Difference]: With dead ends: 628 [2020-02-10 19:44:12,844 INFO L226 Difference]: Without dead ends: 586 [2020-02-10 19:44:12,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-02-10 19:44:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 343. [2020-02-10 19:44:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 19:44:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1092 transitions. [2020-02-10 19:44:12,853 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1092 transitions. Word has length 19 [2020-02-10 19:44:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:12,854 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1092 transitions. [2020-02-10 19:44:12,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1092 transitions. [2020-02-10 19:44:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:12,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:12,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:12,855 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:12,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash 348431156, now seen corresponding path program 83 times [2020-02-10 19:44:12,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:12,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958301190] [2020-02-10 19:44:12,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,045 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:13,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958301190] [2020-02-10 19:44:13,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:13,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921005889] [2020-02-10 19:44:13,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:13,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:13,046 INFO L87 Difference]: Start difference. First operand 343 states and 1092 transitions. Second operand 8 states. [2020-02-10 19:44:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,139 INFO L93 Difference]: Finished difference Result 620 states and 1702 transitions. [2020-02-10 19:44:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:13,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,140 INFO L225 Difference]: With dead ends: 620 [2020-02-10 19:44:13,141 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:44:13,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:44:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 348. [2020-02-10 19:44:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 19:44:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-02-10 19:44:13,148 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-02-10 19:44:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,149 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-02-10 19:44:13,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-02-10 19:44:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:13,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:13,150 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1380616178, now seen corresponding path program 84 times [2020-02-10 19:44:13,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902410120] [2020-02-10 19:44:13,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,335 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:13,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902410120] [2020-02-10 19:44:13,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:13,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984239191] [2020-02-10 19:44:13,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:13,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:13,336 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-02-10 19:44:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,421 INFO L93 Difference]: Finished difference Result 626 states and 1716 transitions. [2020-02-10 19:44:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:13,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,422 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:44:13,423 INFO L226 Difference]: Without dead ends: 582 [2020-02-10 19:44:13,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-02-10 19:44:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 340. [2020-02-10 19:44:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 19:44:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1085 transitions. [2020-02-10 19:44:13,430 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1085 transitions. Word has length 19 [2020-02-10 19:44:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,430 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1085 transitions. [2020-02-10 19:44:13,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1085 transitions. [2020-02-10 19:44:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:13,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:13,431 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1259258648, now seen corresponding path program 85 times [2020-02-10 19:44:13,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782349810] [2020-02-10 19:44:13,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,655 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:13,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782349810] [2020-02-10 19:44:13,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:13,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331164648] [2020-02-10 19:44:13,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:13,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:13,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:13,657 INFO L87 Difference]: Start difference. First operand 340 states and 1085 transitions. Second operand 8 states. [2020-02-10 19:44:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,731 INFO L93 Difference]: Finished difference Result 629 states and 1736 transitions. [2020-02-10 19:44:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:13,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,733 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:44:13,733 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:44:13,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:44:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 350. [2020-02-10 19:44:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 19:44:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1113 transitions. [2020-02-10 19:44:13,740 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1113 transitions. Word has length 19 [2020-02-10 19:44:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,741 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1113 transitions. [2020-02-10 19:44:13,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1113 transitions. [2020-02-10 19:44:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:13,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:13,742 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2010320742, now seen corresponding path program 86 times [2020-02-10 19:44:13,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273577253] [2020-02-10 19:44:13,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,948 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:13,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273577253] [2020-02-10 19:44:13,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:13,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854490887] [2020-02-10 19:44:13,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:13,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:13,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:13,949 INFO L87 Difference]: Start difference. First operand 350 states and 1113 transitions. Second operand 8 states. [2020-02-10 19:44:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,041 INFO L93 Difference]: Finished difference Result 631 states and 1740 transitions. [2020-02-10 19:44:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:14,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,043 INFO L225 Difference]: With dead ends: 631 [2020-02-10 19:44:14,043 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:44:14,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:44:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 345. [2020-02-10 19:44:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-02-10 19:44:14,051 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-02-10 19:44:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,051 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-02-10 19:44:14,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-02-10 19:44:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:14,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:14,052 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1435270794, now seen corresponding path program 87 times [2020-02-10 19:44:14,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971626745] [2020-02-10 19:44:14,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,267 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:14,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971626745] [2020-02-10 19:44:14,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:14,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527510744] [2020-02-10 19:44:14,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:14,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:14,269 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-02-10 19:44:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,341 INFO L93 Difference]: Finished difference Result 633 states and 1743 transitions. [2020-02-10 19:44:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:14,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,343 INFO L225 Difference]: With dead ends: 633 [2020-02-10 19:44:14,343 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:44:14,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:44:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 351. [2020-02-10 19:44:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 19:44:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1110 transitions. [2020-02-10 19:44:14,351 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1110 transitions. Word has length 19 [2020-02-10 19:44:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,351 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1110 transitions. [2020-02-10 19:44:14,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1110 transitions. [2020-02-10 19:44:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:14,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:14,352 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash 459066044, now seen corresponding path program 88 times [2020-02-10 19:44:14,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165395848] [2020-02-10 19:44:14,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,553 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:14,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165395848] [2020-02-10 19:44:14,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:14,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628829832] [2020-02-10 19:44:14,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:14,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:14,555 INFO L87 Difference]: Start difference. First operand 351 states and 1110 transitions. Second operand 8 states. [2020-02-10 19:44:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,659 INFO L93 Difference]: Finished difference Result 638 states and 1755 transitions. [2020-02-10 19:44:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:14,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,661 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:44:14,661 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:44:14,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:44:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 345. [2020-02-10 19:44:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1094 transitions. [2020-02-10 19:44:14,672 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1094 transitions. Word has length 19 [2020-02-10 19:44:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,673 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1094 transitions. [2020-02-10 19:44:14,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1094 transitions. [2020-02-10 19:44:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:14,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:14,674 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2087070376, now seen corresponding path program 89 times [2020-02-10 19:44:14,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084819561] [2020-02-10 19:44:14,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,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:44:14,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084819561] [2020-02-10 19:44:14,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:14,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492051710] [2020-02-10 19:44:14,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:14,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:14,874 INFO L87 Difference]: Start difference. First operand 345 states and 1094 transitions. Second operand 8 states. [2020-02-10 19:44:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,961 INFO L93 Difference]: Finished difference Result 639 states and 1767 transitions. [2020-02-10 19:44:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:14,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,963 INFO L225 Difference]: With dead ends: 639 [2020-02-10 19:44:14,963 INFO L226 Difference]: Without dead ends: 606 [2020-02-10 19:44:14,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-02-10 19:44:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 353. [2020-02-10 19:44:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 19:44:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1114 transitions. [2020-02-10 19:44:14,970 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1114 transitions. Word has length 19 [2020-02-10 19:44:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,970 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1114 transitions. [2020-02-10 19:44:14,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1114 transitions. [2020-02-10 19:44:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:14,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:14,971 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1349022390, now seen corresponding path program 90 times [2020-02-10 19:44:14,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882866142] [2020-02-10 19:44:14,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,191 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:15,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882866142] [2020-02-10 19:44:15,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:15,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:15,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101599257] [2020-02-10 19:44:15,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:15,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:15,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:15,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:15,192 INFO L87 Difference]: Start difference. First operand 353 states and 1114 transitions. Second operand 8 states. [2020-02-10 19:44:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,288 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-02-10 19:44:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:15,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,290 INFO L225 Difference]: With dead ends: 642 [2020-02-10 19:44:15,290 INFO L226 Difference]: Without dead ends: 593 [2020-02-10 19:44:15,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-02-10 19:44:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 340. [2020-02-10 19:44:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 19:44:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1082 transitions. [2020-02-10 19:44:15,298 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1082 transitions. Word has length 19 [2020-02-10 19:44:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,298 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1082 transitions. [2020-02-10 19:44:15,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1082 transitions. [2020-02-10 19:44:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:15,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:15,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:15,299 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1252078038, now seen corresponding path program 91 times [2020-02-10 19:44:15,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139840402] [2020-02-10 19:44:15,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,493 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:15,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139840402] [2020-02-10 19:44:15,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:15,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:15,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523793924] [2020-02-10 19:44:15,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:15,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:15,495 INFO L87 Difference]: Start difference. First operand 340 states and 1082 transitions. Second operand 8 states. [2020-02-10 19:44:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,578 INFO L93 Difference]: Finished difference Result 622 states and 1721 transitions. [2020-02-10 19:44:15,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:15,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,579 INFO L225 Difference]: With dead ends: 622 [2020-02-10 19:44:15,579 INFO L226 Difference]: Without dead ends: 592 [2020-02-10 19:44:15,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-02-10 19:44:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-02-10 19:44:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-02-10 19:44:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1106 transitions. [2020-02-10 19:44:15,587 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1106 transitions. Word has length 19 [2020-02-10 19:44:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,587 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 1106 transitions. [2020-02-10 19:44:15,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1106 transitions. [2020-02-10 19:44:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:15,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:15,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:15,588 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1332275950, now seen corresponding path program 92 times [2020-02-10 19:44:15,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462165543] [2020-02-10 19:44:15,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,784 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:15,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462165543] [2020-02-10 19:44:15,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:15,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:15,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443788277] [2020-02-10 19:44:15,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:15,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:15,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:15,786 INFO L87 Difference]: Start difference. First operand 348 states and 1106 transitions. Second operand 8 states. [2020-02-10 19:44:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,873 INFO L93 Difference]: Finished difference Result 625 states and 1727 transitions. [2020-02-10 19:44:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:15,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,875 INFO L225 Difference]: With dead ends: 625 [2020-02-10 19:44:15,875 INFO L226 Difference]: Without dead ends: 588 [2020-02-10 19:44:15,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-02-10 19:44:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 344. [2020-02-10 19:44:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 19:44:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-02-10 19:44:15,882 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-02-10 19:44:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,882 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-02-10 19:44:15,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-02-10 19:44:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:15,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:15,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:15,883 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1996780536, now seen corresponding path program 93 times [2020-02-10 19:44:15,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435557639] [2020-02-10 19:44:15,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,082 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:16,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435557639] [2020-02-10 19:44:16,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:16,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023080294] [2020-02-10 19:44:16,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:16,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:16,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:16,085 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-02-10 19:44:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,184 INFO L93 Difference]: Finished difference Result 626 states and 1729 transitions. [2020-02-10 19:44:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:16,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,185 INFO L225 Difference]: With dead ends: 626 [2020-02-10 19:44:16,185 INFO L226 Difference]: Without dead ends: 596 [2020-02-10 19:44:16,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-02-10 19:44:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 349. [2020-02-10 19:44:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1104 transitions. [2020-02-10 19:44:16,191 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1104 transitions. Word has length 19 [2020-02-10 19:44:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,191 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1104 transitions. [2020-02-10 19:44:16,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1104 transitions. [2020-02-10 19:44:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:16,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,192 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:16,192 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash 267733202, now seen corresponding path program 94 times [2020-02-10 19:44:16,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780792095] [2020-02-10 19:44:16,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,382 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:16,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780792095] [2020-02-10 19:44:16,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:16,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16675528] [2020-02-10 19:44:16,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:16,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:16,384 INFO L87 Difference]: Start difference. First operand 349 states and 1104 transitions. Second operand 8 states. [2020-02-10 19:44:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,471 INFO L93 Difference]: Finished difference Result 632 states and 1743 transitions. [2020-02-10 19:44:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:16,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,473 INFO L225 Difference]: With dead ends: 632 [2020-02-10 19:44:16,473 INFO L226 Difference]: Without dead ends: 591 [2020-02-10 19:44:16,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-02-10 19:44:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 344. [2020-02-10 19:44:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 19:44:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1090 transitions. [2020-02-10 19:44:16,480 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1090 transitions. Word has length 19 [2020-02-10 19:44:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,480 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1090 transitions. [2020-02-10 19:44:16,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1090 transitions. [2020-02-10 19:44:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:16,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:16,481 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash 901831544, now seen corresponding path program 95 times [2020-02-10 19:44:16,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609560301] [2020-02-10 19:44:16,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,712 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:16,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609560301] [2020-02-10 19:44:16,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:16,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719947774] [2020-02-10 19:44:16,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:16,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:16,714 INFO L87 Difference]: Start difference. First operand 344 states and 1090 transitions. Second operand 8 states. [2020-02-10 19:44:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,791 INFO L93 Difference]: Finished difference Result 635 states and 1758 transitions. [2020-02-10 19:44:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:16,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,793 INFO L225 Difference]: With dead ends: 635 [2020-02-10 19:44:16,793 INFO L226 Difference]: Without dead ends: 602 [2020-02-10 19:44:16,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-02-10 19:44:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 352. [2020-02-10 19:44:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 19:44:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1110 transitions. [2020-02-10 19:44:16,801 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1110 transitions. Word has length 19 [2020-02-10 19:44:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,801 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1110 transitions. [2020-02-10 19:44:16,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1110 transitions. [2020-02-10 19:44:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:16,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:16,803 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1757138198, now seen corresponding path program 96 times [2020-02-10 19:44:16,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581279877] [2020-02-10 19:44:16,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,004 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:17,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581279877] [2020-02-10 19:44:17,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:17,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049355717] [2020-02-10 19:44:17,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:17,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:17,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:17,006 INFO L87 Difference]: Start difference. First operand 352 states and 1110 transitions. Second operand 8 states. [2020-02-10 19:44:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,111 INFO L93 Difference]: Finished difference Result 638 states and 1759 transitions. [2020-02-10 19:44:17,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:17,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,113 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:44:17,114 INFO L226 Difference]: Without dead ends: 587 [2020-02-10 19:44:17,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-02-10 19:44:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 337. [2020-02-10 19:44:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-02-10 19:44:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1075 transitions. [2020-02-10 19:44:17,124 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1075 transitions. Word has length 19 [2020-02-10 19:44:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,125 INFO L479 AbstractCegarLoop]: Abstraction has 337 states and 1075 transitions. [2020-02-10 19:44:17,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1075 transitions. [2020-02-10 19:44:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:17,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:17,126 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1665827752, now seen corresponding path program 97 times [2020-02-10 19:44:17,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78147269] [2020-02-10 19:44:17,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,353 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:17,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78147269] [2020-02-10 19:44:17,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:17,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035852728] [2020-02-10 19:44:17,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:17,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:17,356 INFO L87 Difference]: Start difference. First operand 337 states and 1075 transitions. Second operand 8 states. [2020-02-10 19:44:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,447 INFO L93 Difference]: Finished difference Result 676 states and 1927 transitions. [2020-02-10 19:44:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:17,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,449 INFO L225 Difference]: With dead ends: 676 [2020-02-10 19:44:17,449 INFO L226 Difference]: Without dead ends: 636 [2020-02-10 19:44:17,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-02-10 19:44:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 351. [2020-02-10 19:44:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 19:44:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1123 transitions. [2020-02-10 19:44:17,462 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1123 transitions. Word has length 19 [2020-02-10 19:44:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,462 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1123 transitions. [2020-02-10 19:44:17,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1123 transitions. [2020-02-10 19:44:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:17,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:17,464 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 791492426, now seen corresponding path program 98 times [2020-02-10 19:44:17,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557205023] [2020-02-10 19:44:17,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,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:44:17,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557205023] [2020-02-10 19:44:17,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:17,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143561019] [2020-02-10 19:44:17,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:17,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:17,643 INFO L87 Difference]: Start difference. First operand 351 states and 1123 transitions. Second operand 8 states. [2020-02-10 19:44:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,729 INFO L93 Difference]: Finished difference Result 666 states and 1890 transitions. [2020-02-10 19:44:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:17,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,731 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:44:17,731 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:44:17,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:44:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 345. [2020-02-10 19:44:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1107 transitions. [2020-02-10 19:44:17,740 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1107 transitions. Word has length 19 [2020-02-10 19:44:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,740 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1107 transitions. [2020-02-10 19:44:17,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1107 transitions. [2020-02-10 19:44:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:17,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:17,742 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1139734548, now seen corresponding path program 99 times [2020-02-10 19:44:17,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482433996] [2020-02-10 19:44:17,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,928 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:17,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482433996] [2020-02-10 19:44:17,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:17,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580538107] [2020-02-10 19:44:17,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:17,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:17,929 INFO L87 Difference]: Start difference. First operand 345 states and 1107 transitions. Second operand 8 states. [2020-02-10 19:44:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,017 INFO L93 Difference]: Finished difference Result 682 states and 1946 transitions. [2020-02-10 19:44:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:18,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,019 INFO L225 Difference]: With dead ends: 682 [2020-02-10 19:44:18,019 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:44:18,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:44:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2020-02-10 19:44:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-02-10 19:44:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1129 transitions. [2020-02-10 19:44:18,026 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1129 transitions. Word has length 19 [2020-02-10 19:44:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,026 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 1129 transitions. [2020-02-10 19:44:18,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1129 transitions. [2020-02-10 19:44:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:18,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,027 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:18,028 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1885031692, now seen corresponding path program 100 times [2020-02-10 19:44:18,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559385197] [2020-02-10 19:44:18,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:18,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559385197] [2020-02-10 19:44:18,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:18,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493398057] [2020-02-10 19:44:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:18,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:18,220 INFO L87 Difference]: Start difference. First operand 354 states and 1129 transitions. Second operand 8 states. [2020-02-10 19:44:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,322 INFO L93 Difference]: Finished difference Result 675 states and 1916 transitions. [2020-02-10 19:44:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:18,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,323 INFO L225 Difference]: With dead ends: 675 [2020-02-10 19:44:18,323 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:44:18,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:44:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 345. [2020-02-10 19:44:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-02-10 19:44:18,335 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-02-10 19:44:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,335 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-02-10 19:44:18,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-02-10 19:44:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:18,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:18,336 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 220037620, now seen corresponding path program 101 times [2020-02-10 19:44:18,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640524707] [2020-02-10 19:44:18,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,535 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:18,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640524707] [2020-02-10 19:44:18,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:18,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638850918] [2020-02-10 19:44:18,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:18,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:18,537 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-02-10 19:44:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,613 INFO L93 Difference]: Finished difference Result 657 states and 1861 transitions. [2020-02-10 19:44:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:18,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,615 INFO L225 Difference]: With dead ends: 657 [2020-02-10 19:44:18,615 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:44:18,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:44:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 349. [2020-02-10 19:44:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1111 transitions. [2020-02-10 19:44:18,623 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1111 transitions. Word has length 19 [2020-02-10 19:44:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,623 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1111 transitions. [2020-02-10 19:44:18,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1111 transitions. [2020-02-10 19:44:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:18,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:18,624 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1930650928, now seen corresponding path program 102 times [2020-02-10 19:44:18,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403528863] [2020-02-10 19:44:18,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,817 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:18,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403528863] [2020-02-10 19:44:18,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:18,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985822232] [2020-02-10 19:44:18,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:18,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:18,819 INFO L87 Difference]: Start difference. First operand 349 states and 1111 transitions. Second operand 8 states. [2020-02-10 19:44:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,913 INFO L93 Difference]: Finished difference Result 660 states and 1867 transitions. [2020-02-10 19:44:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:18,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,915 INFO L225 Difference]: With dead ends: 660 [2020-02-10 19:44:18,915 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:44:18,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:44:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-02-10 19:44:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1091 transitions. [2020-02-10 19:44:18,923 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1091 transitions. Word has length 19 [2020-02-10 19:44:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,923 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1091 transitions. [2020-02-10 19:44:18,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1091 transitions. [2020-02-10 19:44:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:18,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:18,924 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1018198586, now seen corresponding path program 103 times [2020-02-10 19:44:18,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981929198] [2020-02-10 19:44:18,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,104 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:19,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981929198] [2020-02-10 19:44:19,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:19,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296711631] [2020-02-10 19:44:19,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:19,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:19,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:19,105 INFO L87 Difference]: Start difference. First operand 341 states and 1091 transitions. Second operand 8 states. [2020-02-10 19:44:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:19,194 INFO L93 Difference]: Finished difference Result 684 states and 1951 transitions. [2020-02-10 19:44:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:19,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:19,196 INFO L225 Difference]: With dead ends: 684 [2020-02-10 19:44:19,196 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 19:44:19,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 19:44:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 352. [2020-02-10 19:44:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-02-10 19:44:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1123 transitions. [2020-02-10 19:44:19,203 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1123 transitions. Word has length 19 [2020-02-10 19:44:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:19,203 INFO L479 AbstractCegarLoop]: Abstraction has 352 states and 1123 transitions. [2020-02-10 19:44:19,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1123 transitions. [2020-02-10 19:44:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:19,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:19,204 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:19,204 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1892533912, now seen corresponding path program 104 times [2020-02-10 19:44:19,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:19,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096642855] [2020-02-10 19:44:19,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,383 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:19,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096642855] [2020-02-10 19:44:19,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:19,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963899108] [2020-02-10 19:44:19,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:19,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:19,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:19,384 INFO L87 Difference]: Start difference. First operand 352 states and 1123 transitions. Second operand 8 states. [2020-02-10 19:44:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:19,467 INFO L93 Difference]: Finished difference Result 674 states and 1914 transitions. [2020-02-10 19:44:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:19,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:19,470 INFO L225 Difference]: With dead ends: 674 [2020-02-10 19:44:19,470 INFO L226 Difference]: Without dead ends: 638 [2020-02-10 19:44:19,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-02-10 19:44:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 346. [2020-02-10 19:44:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 19:44:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1106 transitions. [2020-02-10 19:44:19,480 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1106 transitions. Word has length 19 [2020-02-10 19:44:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:19,480 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1106 transitions. [2020-02-10 19:44:19,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1106 transitions. [2020-02-10 19:44:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:19,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:19,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:19,481 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1215908908, now seen corresponding path program 105 times [2020-02-10 19:44:19,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:19,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660788506] [2020-02-10 19:44:19,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,680 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:19,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660788506] [2020-02-10 19:44:19,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:19,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127023630] [2020-02-10 19:44:19,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:19,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:19,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:19,682 INFO L87 Difference]: Start difference. First operand 346 states and 1106 transitions. Second operand 8 states. [2020-02-10 19:44:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:19,787 INFO L93 Difference]: Finished difference Result 696 states and 1990 transitions. [2020-02-10 19:44:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:19,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:19,789 INFO L225 Difference]: With dead ends: 696 [2020-02-10 19:44:19,789 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:44:19,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:44:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 358. [2020-02-10 19:44:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-02-10 19:44:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1137 transitions. [2020-02-10 19:44:19,802 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1137 transitions. Word has length 19 [2020-02-10 19:44:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:19,803 INFO L479 AbstractCegarLoop]: Abstraction has 358 states and 1137 transitions. [2020-02-10 19:44:19,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1137 transitions. [2020-02-10 19:44:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:19,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:19,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:19,805 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2110174348, now seen corresponding path program 106 times [2020-02-10 19:44:19,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:19,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584962005] [2020-02-10 19:44:19,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,031 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:20,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584962005] [2020-02-10 19:44:20,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:20,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800474707] [2020-02-10 19:44:20,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:20,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:20,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:20,032 INFO L87 Difference]: Start difference. First operand 358 states and 1137 transitions. Second operand 8 states. [2020-02-10 19:44:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,113 INFO L93 Difference]: Finished difference Result 692 states and 1966 transitions. [2020-02-10 19:44:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:20,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,115 INFO L225 Difference]: With dead ends: 692 [2020-02-10 19:44:20,115 INFO L226 Difference]: Without dead ends: 644 [2020-02-10 19:44:20,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-02-10 19:44:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 346. [2020-02-10 19:44:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 19:44:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-02-10 19:44:20,125 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-02-10 19:44:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,125 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-02-10 19:44:20,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-02-10 19:44:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:20,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:20,126 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1719286220, now seen corresponding path program 107 times [2020-02-10 19:44:20,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141895873] [2020-02-10 19:44:20,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,320 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:20,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141895873] [2020-02-10 19:44:20,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:20,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179304244] [2020-02-10 19:44:20,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:20,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:20,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:20,322 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-02-10 19:44:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,401 INFO L93 Difference]: Finished difference Result 669 states and 1895 transitions. [2020-02-10 19:44:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:20,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,403 INFO L225 Difference]: With dead ends: 669 [2020-02-10 19:44:20,403 INFO L226 Difference]: Without dead ends: 639 [2020-02-10 19:44:20,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-02-10 19:44:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 351. [2020-02-10 19:44:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-02-10 19:44:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1111 transitions. [2020-02-10 19:44:20,410 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1111 transitions. Word has length 19 [2020-02-10 19:44:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,411 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 1111 transitions. [2020-02-10 19:44:20,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1111 transitions. [2020-02-10 19:44:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:20,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:20,411 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash 846633742, now seen corresponding path program 108 times [2020-02-10 19:44:20,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665516428] [2020-02-10 19:44:20,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,586 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:20,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665516428] [2020-02-10 19:44:20,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:20,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953987335] [2020-02-10 19:44:20,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:20,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:20,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:20,587 INFO L87 Difference]: Start difference. First operand 351 states and 1111 transitions. Second operand 8 states. [2020-02-10 19:44:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,667 INFO L93 Difference]: Finished difference Result 675 states and 1909 transitions. [2020-02-10 19:44:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:20,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,669 INFO L225 Difference]: With dead ends: 675 [2020-02-10 19:44:20,670 INFO L226 Difference]: Without dead ends: 629 [2020-02-10 19:44:20,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-02-10 19:44:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 341. [2020-02-10 19:44:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-02-10 19:44:20,677 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-02-10 19:44:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,677 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-02-10 19:44:20,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-02-10 19:44:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:20,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:20,678 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash -601878970, now seen corresponding path program 109 times [2020-02-10 19:44:20,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140379244] [2020-02-10 19:44:20,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,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:44:20,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140379244] [2020-02-10 19:44:20,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:20,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353275684] [2020-02-10 19:44:20,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:20,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:20,871 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-02-10 19:44:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,959 INFO L93 Difference]: Finished difference Result 702 states and 2022 transitions. [2020-02-10 19:44:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:20,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,960 INFO L225 Difference]: With dead ends: 702 [2020-02-10 19:44:20,960 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 19:44:20,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 19:44:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 358. [2020-02-10 19:44:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-02-10 19:44:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1145 transitions. [2020-02-10 19:44:20,968 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1145 transitions. Word has length 19 [2020-02-10 19:44:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,968 INFO L479 AbstractCegarLoop]: Abstraction has 358 states and 1145 transitions. [2020-02-10 19:44:20,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1145 transitions. [2020-02-10 19:44:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:20,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:20,969 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1347176114, now seen corresponding path program 110 times [2020-02-10 19:44:20,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357849264] [2020-02-10 19:44:20,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:21,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357849264] [2020-02-10 19:44:21,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:21,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13781201] [2020-02-10 19:44:21,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:21,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:21,156 INFO L87 Difference]: Start difference. First operand 358 states and 1145 transitions. Second operand 8 states. [2020-02-10 19:44:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,237 INFO L93 Difference]: Finished difference Result 695 states and 1992 transitions. [2020-02-10 19:44:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:21,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,239 INFO L225 Difference]: With dead ends: 695 [2020-02-10 19:44:21,239 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:44:21,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:44:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 349. [2020-02-10 19:44:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1115 transitions. [2020-02-10 19:44:21,247 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1115 transitions. Word has length 19 [2020-02-10 19:44:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,247 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1115 transitions. [2020-02-10 19:44:21,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1115 transitions. [2020-02-10 19:44:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:21,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:21,248 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash 142823528, now seen corresponding path program 111 times [2020-02-10 19:44:21,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066379362] [2020-02-10 19:44:21,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,444 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:21,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066379362] [2020-02-10 19:44:21,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:21,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16255865] [2020-02-10 19:44:21,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:21,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:21,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:21,446 INFO L87 Difference]: Start difference. First operand 349 states and 1115 transitions. Second operand 8 states. [2020-02-10 19:44:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,529 INFO L93 Difference]: Finished difference Result 708 states and 2035 transitions. [2020-02-10 19:44:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:21,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,531 INFO L225 Difference]: With dead ends: 708 [2020-02-10 19:44:21,531 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 19:44:21,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 19:44:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 361. [2020-02-10 19:44:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-02-10 19:44:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1146 transitions. [2020-02-10 19:44:21,539 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1146 transitions. Word has length 19 [2020-02-10 19:44:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,539 INFO L479 AbstractCegarLoop]: Abstraction has 361 states and 1146 transitions. [2020-02-10 19:44:21,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1146 transitions. [2020-02-10 19:44:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:21,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:21,540 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1111707568, now seen corresponding path program 112 times [2020-02-10 19:44:21,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812494712] [2020-02-10 19:44:21,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,755 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:21,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812494712] [2020-02-10 19:44:21,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:21,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903642161] [2020-02-10 19:44:21,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:21,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:21,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:21,757 INFO L87 Difference]: Start difference. First operand 361 states and 1146 transitions. Second operand 8 states. [2020-02-10 19:44:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,848 INFO L93 Difference]: Finished difference Result 704 states and 2011 transitions. [2020-02-10 19:44:21,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:21,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,850 INFO L225 Difference]: With dead ends: 704 [2020-02-10 19:44:21,850 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:44:21,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:44:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 349. [2020-02-10 19:44:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-02-10 19:44:21,857 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-02-10 19:44:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,857 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-02-10 19:44:21,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-02-10 19:44:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:21,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:21,858 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1376541946, now seen corresponding path program 113 times [2020-02-10 19:44:21,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964207470] [2020-02-10 19:44:21,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:22,123 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:22,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964207470] [2020-02-10 19:44:22,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:22,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419460985] [2020-02-10 19:44:22,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:22,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:22,125 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-02-10 19:44:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:22,224 INFO L93 Difference]: Finished difference Result 690 states and 1970 transitions. [2020-02-10 19:44:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:22,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:22,225 INFO L225 Difference]: With dead ends: 690 [2020-02-10 19:44:22,226 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 19:44:22,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 19:44:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 357. [2020-02-10 19:44:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-02-10 19:44:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1127 transitions. [2020-02-10 19:44:22,236 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1127 transitions. Word has length 19 [2020-02-10 19:44:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:22,237 INFO L479 AbstractCegarLoop]: Abstraction has 357 states and 1127 transitions. [2020-02-10 19:44:22,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1127 transitions. [2020-02-10 19:44:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:22,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:22,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:22,238 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash -517667416, now seen corresponding path program 114 times [2020-02-10 19:44:22,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:22,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459573299] [2020-02-10 19:44:22,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:22,425 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:22,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459573299] [2020-02-10 19:44:22,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:22,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492623714] [2020-02-10 19:44:22,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:22,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:22,427 INFO L87 Difference]: Start difference. First operand 357 states and 1127 transitions. Second operand 8 states. [2020-02-10 19:44:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:22,505 INFO L93 Difference]: Finished difference Result 693 states and 1971 transitions. [2020-02-10 19:44:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:22,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:22,507 INFO L225 Difference]: With dead ends: 693 [2020-02-10 19:44:22,507 INFO L226 Difference]: Without dead ends: 641 [2020-02-10 19:44:22,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-02-10 19:44:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 341. [2020-02-10 19:44:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2020-02-10 19:44:22,515 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 19 [2020-02-10 19:44:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:22,515 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2020-02-10 19:44:22,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2020-02-10 19:44:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:22,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:22,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:22,516 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1295748776, now seen corresponding path program 115 times [2020-02-10 19:44:22,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:22,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397519760] [2020-02-10 19:44:22,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:22,718 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:22,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397519760] [2020-02-10 19:44:22,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:22,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721742259] [2020-02-10 19:44:22,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:22,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:22,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:22,719 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand 8 states. [2020-02-10 19:44:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:22,795 INFO L93 Difference]: Finished difference Result 651 states and 1839 transitions. [2020-02-10 19:44:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:22,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:22,796 INFO L225 Difference]: With dead ends: 651 [2020-02-10 19:44:22,796 INFO L226 Difference]: Without dead ends: 621 [2020-02-10 19:44:22,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-02-10 19:44:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 349. [2020-02-10 19:44:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-02-10 19:44:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-02-10 19:44:22,804 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-02-10 19:44:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:22,804 INFO L479 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-02-10 19:44:22,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-02-10 19:44:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:22,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:22,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:22,805 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:22,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1288605212, now seen corresponding path program 116 times [2020-02-10 19:44:22,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:22,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420587757] [2020-02-10 19:44:22,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,026 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:23,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420587757] [2020-02-10 19:44:23,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:23,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604336472] [2020-02-10 19:44:23,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:23,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:23,027 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-02-10 19:44:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,105 INFO L93 Difference]: Finished difference Result 654 states and 1845 transitions. [2020-02-10 19:44:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:23,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,108 INFO L225 Difference]: With dead ends: 654 [2020-02-10 19:44:23,108 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:23,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 345. [2020-02-10 19:44:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-02-10 19:44:23,118 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-02-10 19:44:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,118 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-02-10 19:44:23,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-02-10 19:44:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:23,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:23,119 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:23,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2040451274, now seen corresponding path program 117 times [2020-02-10 19:44:23,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150067603] [2020-02-10 19:44:23,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,326 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:23,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150067603] [2020-02-10 19:44:23,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:23,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859272180] [2020-02-10 19:44:23,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:23,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:23,327 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-02-10 19:44:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,406 INFO L93 Difference]: Finished difference Result 655 states and 1847 transitions. [2020-02-10 19:44:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:23,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,408 INFO L225 Difference]: With dead ends: 655 [2020-02-10 19:44:23,408 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:44:23,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:44:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 350. [2020-02-10 19:44:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 19:44:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-02-10 19:44:23,415 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-02-10 19:44:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,416 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-02-10 19:44:23,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-02-10 19:44:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:23,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:23,416 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash 311403940, now seen corresponding path program 118 times [2020-02-10 19:44:23,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258427355] [2020-02-10 19:44:23,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,608 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:23,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258427355] [2020-02-10 19:44:23,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:23,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162670107] [2020-02-10 19:44:23,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:23,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:23,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:23,610 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-02-10 19:44:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,690 INFO L93 Difference]: Finished difference Result 661 states and 1861 transitions. [2020-02-10 19:44:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:23,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,692 INFO L225 Difference]: With dead ends: 661 [2020-02-10 19:44:23,692 INFO L226 Difference]: Without dead ends: 620 [2020-02-10 19:44:23,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-02-10 19:44:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 345. [2020-02-10 19:44:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1091 transitions. [2020-02-10 19:44:23,700 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1091 transitions. Word has length 19 [2020-02-10 19:44:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,700 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1091 transitions. [2020-02-10 19:44:23,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1091 transitions. [2020-02-10 19:44:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:23,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:23,701 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:23,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,701 INFO L82 PathProgramCache]: Analyzing trace with hash 945502282, now seen corresponding path program 119 times [2020-02-10 19:44:23,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624394026] [2020-02-10 19:44:23,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,893 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:23,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624394026] [2020-02-10 19:44:23,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:23,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715215919] [2020-02-10 19:44:23,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:23,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:23,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:23,895 INFO L87 Difference]: Start difference. First operand 345 states and 1091 transitions. Second operand 8 states. [2020-02-10 19:44:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,970 INFO L93 Difference]: Finished difference Result 664 states and 1876 transitions. [2020-02-10 19:44:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:23,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,971 INFO L225 Difference]: With dead ends: 664 [2020-02-10 19:44:23,971 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:44:23,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:44:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 353. [2020-02-10 19:44:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-02-10 19:44:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1111 transitions. [2020-02-10 19:44:23,980 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1111 transitions. Word has length 19 [2020-02-10 19:44:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,980 INFO L479 AbstractCegarLoop]: Abstraction has 353 states and 1111 transitions. [2020-02-10 19:44:23,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1111 transitions. [2020-02-10 19:44:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:23,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:23,981 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1800808936, now seen corresponding path program 120 times [2020-02-10 19:44:23,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060521057] [2020-02-10 19:44:23,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,202 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:24,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060521057] [2020-02-10 19:44:24,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:24,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699087370] [2020-02-10 19:44:24,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:24,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:24,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:24,204 INFO L87 Difference]: Start difference. First operand 353 states and 1111 transitions. Second operand 8 states. [2020-02-10 19:44:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,284 INFO L93 Difference]: Finished difference Result 667 states and 1877 transitions. [2020-02-10 19:44:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:24,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,286 INFO L225 Difference]: With dead ends: 667 [2020-02-10 19:44:24,286 INFO L226 Difference]: Without dead ends: 608 [2020-02-10 19:44:24,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-02-10 19:44:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 330. [2020-02-10 19:44:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 19:44:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1061 transitions. [2020-02-10 19:44:24,294 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1061 transitions. Word has length 19 [2020-02-10 19:44:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,294 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1061 transitions. [2020-02-10 19:44:24,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1061 transitions. [2020-02-10 19:44:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:24,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:24,295 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 822861400, now seen corresponding path program 121 times [2020-02-10 19:44:24,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524850216] [2020-02-10 19:44:24,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,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:44:24,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524850216] [2020-02-10 19:44:24,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:24,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027662362] [2020-02-10 19:44:24,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:24,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:24,520 INFO L87 Difference]: Start difference. First operand 330 states and 1061 transitions. Second operand 8 states. [2020-02-10 19:44:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,591 INFO L93 Difference]: Finished difference Result 685 states and 1929 transitions. [2020-02-10 19:44:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:24,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,593 INFO L225 Difference]: With dead ends: 685 [2020-02-10 19:44:24,593 INFO L226 Difference]: Without dead ends: 654 [2020-02-10 19:44:24,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-02-10 19:44:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 346. [2020-02-10 19:44:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 19:44:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-02-10 19:44:24,601 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-02-10 19:44:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,601 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-02-10 19:44:24,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-02-10 19:44:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:24,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:24,602 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1197512586, now seen corresponding path program 122 times [2020-02-10 19:44:24,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543934535] [2020-02-10 19:44:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,814 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:24,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543934535] [2020-02-10 19:44:24,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:24,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943561236] [2020-02-10 19:44:24,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:24,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:24,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:24,815 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-02-10 19:44:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,893 INFO L93 Difference]: Finished difference Result 694 states and 1952 transitions. [2020-02-10 19:44:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:24,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,895 INFO L225 Difference]: With dead ends: 694 [2020-02-10 19:44:24,895 INFO L226 Difference]: Without dead ends: 646 [2020-02-10 19:44:24,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-02-10 19:44:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 338. [2020-02-10 19:44:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 19:44:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1080 transitions. [2020-02-10 19:44:24,903 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1080 transitions. Word has length 19 [2020-02-10 19:44:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,903 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1080 transitions. [2020-02-10 19:44:24,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1080 transitions. [2020-02-10 19:44:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:24,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:24,904 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2004251154, now seen corresponding path program 123 times [2020-02-10 19:44:24,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296658598] [2020-02-10 19:44:24,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,119 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:25,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296658598] [2020-02-10 19:44:25,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:25,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703058597] [2020-02-10 19:44:25,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:25,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:25,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:25,121 INFO L87 Difference]: Start difference. First operand 338 states and 1080 transitions. Second operand 8 states. [2020-02-10 19:44:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:25,189 INFO L93 Difference]: Finished difference Result 679 states and 1906 transitions. [2020-02-10 19:44:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:25,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:25,191 INFO L225 Difference]: With dead ends: 679 [2020-02-10 19:44:25,191 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:44:25,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:44:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 344. [2020-02-10 19:44:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 19:44:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1091 transitions. [2020-02-10 19:44:25,198 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1091 transitions. Word has length 19 [2020-02-10 19:44:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:25,198 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1091 transitions. [2020-02-10 19:44:25,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1091 transitions. [2020-02-10 19:44:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:25,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:25,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:25,199 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1028046404, now seen corresponding path program 124 times [2020-02-10 19:44:25,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:25,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985708445] [2020-02-10 19:44:25,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,435 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:25,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985708445] [2020-02-10 19:44:25,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:25,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593849945] [2020-02-10 19:44:25,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:25,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:25,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:25,437 INFO L87 Difference]: Start difference. First operand 344 states and 1091 transitions. Second operand 8 states. [2020-02-10 19:44:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:25,518 INFO L93 Difference]: Finished difference Result 684 states and 1918 transitions. [2020-02-10 19:44:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:25,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:25,520 INFO L225 Difference]: With dead ends: 684 [2020-02-10 19:44:25,520 INFO L226 Difference]: Without dead ends: 642 [2020-02-10 19:44:25,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-02-10 19:44:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 338. [2020-02-10 19:44:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 19:44:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1074 transitions. [2020-02-10 19:44:25,530 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1074 transitions. Word has length 19 [2020-02-10 19:44:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:25,530 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1074 transitions. [2020-02-10 19:44:25,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1074 transitions. [2020-02-10 19:44:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:25,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:25,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:25,536 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1100948602, now seen corresponding path program 125 times [2020-02-10 19:44:25,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:25,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854815642] [2020-02-10 19:44:25,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,760 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:25,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854815642] [2020-02-10 19:44:25,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:25,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751941547] [2020-02-10 19:44:25,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:25,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:25,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:25,763 INFO L87 Difference]: Start difference. First operand 338 states and 1074 transitions. Second operand 8 states. [2020-02-10 19:44:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:25,843 INFO L93 Difference]: Finished difference Result 703 states and 1986 transitions. [2020-02-10 19:44:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:25,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:25,845 INFO L225 Difference]: With dead ends: 703 [2020-02-10 19:44:25,845 INFO L226 Difference]: Without dead ends: 663 [2020-02-10 19:44:25,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-02-10 19:44:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 350. [2020-02-10 19:44:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 19:44:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-02-10 19:44:25,853 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-02-10 19:44:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:25,853 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-02-10 19:44:25,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-02-10 19:44:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:25,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:25,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:25,855 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash -242668718, now seen corresponding path program 126 times [2020-02-10 19:44:25,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:25,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741794548] [2020-02-10 19:44:25,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,071 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:26,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741794548] [2020-02-10 19:44:26,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:26,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206962415] [2020-02-10 19:44:26,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:26,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:26,073 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-02-10 19:44:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,161 INFO L93 Difference]: Finished difference Result 699 states and 1962 transitions. [2020-02-10 19:44:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:26,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,164 INFO L225 Difference]: With dead ends: 699 [2020-02-10 19:44:26,164 INFO L226 Difference]: Without dead ends: 643 [2020-02-10 19:44:26,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-02-10 19:44:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 330. [2020-02-10 19:44:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 19:44:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1054 transitions. [2020-02-10 19:44:26,171 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1054 transitions. Word has length 19 [2020-02-10 19:44:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,172 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1054 transitions. [2020-02-10 19:44:26,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1054 transitions. [2020-02-10 19:44:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:26,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:26,173 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1565948490, now seen corresponding path program 127 times [2020-02-10 19:44:26,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903116627] [2020-02-10 19:44:26,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:26,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903116627] [2020-02-10 19:44:26,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:26,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988109983] [2020-02-10 19:44:26,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:26,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:26,407 INFO L87 Difference]: Start difference. First operand 330 states and 1054 transitions. Second operand 8 states. [2020-02-10 19:44:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,468 INFO L93 Difference]: Finished difference Result 676 states and 1893 transitions. [2020-02-10 19:44:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:26,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,470 INFO L225 Difference]: With dead ends: 676 [2020-02-10 19:44:26,471 INFO L226 Difference]: Without dead ends: 645 [2020-02-10 19:44:26,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-02-10 19:44:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 344. [2020-02-10 19:44:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-02-10 19:44:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1089 transitions. [2020-02-10 19:44:26,478 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1089 transitions. Word has length 19 [2020-02-10 19:44:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,478 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 1089 transitions. [2020-02-10 19:44:26,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1089 transitions. [2020-02-10 19:44:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:26,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,479 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:26,479 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:26,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1940599676, now seen corresponding path program 128 times [2020-02-10 19:44:26,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173642208] [2020-02-10 19:44:26,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,711 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:26,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173642208] [2020-02-10 19:44:26,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:26,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687765633] [2020-02-10 19:44:26,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:26,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:26,713 INFO L87 Difference]: Start difference. First operand 344 states and 1089 transitions. Second operand 8 states. [2020-02-10 19:44:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,797 INFO L93 Difference]: Finished difference Result 685 states and 1916 transitions. [2020-02-10 19:44:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:26,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,799 INFO L225 Difference]: With dead ends: 685 [2020-02-10 19:44:26,799 INFO L226 Difference]: Without dead ends: 637 [2020-02-10 19:44:26,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-02-10 19:44:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 336. [2020-02-10 19:44:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-02-10 19:44:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1069 transitions. [2020-02-10 19:44:26,808 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1069 transitions. Word has length 19 [2020-02-10 19:44:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,808 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 1069 transitions. [2020-02-10 19:44:26,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1069 transitions. [2020-02-10 19:44:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:26,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:26,809 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1873225276, now seen corresponding path program 129 times [2020-02-10 19:44:26,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388646500] [2020-02-10 19:44:26,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,021 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:27,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388646500] [2020-02-10 19:44:27,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:27,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998372131] [2020-02-10 19:44:27,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:27,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:27,023 INFO L87 Difference]: Start difference. First operand 336 states and 1069 transitions. Second operand 8 states. [2020-02-10 19:44:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,083 INFO L93 Difference]: Finished difference Result 666 states and 1859 transitions. [2020-02-10 19:44:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:27,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,085 INFO L225 Difference]: With dead ends: 666 [2020-02-10 19:44:27,085 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:44:27,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:44:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 341. [2020-02-10 19:44:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1078 transitions. [2020-02-10 19:44:27,092 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1078 transitions. Word has length 19 [2020-02-10 19:44:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,092 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1078 transitions. [2020-02-10 19:44:27,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1078 transitions. [2020-02-10 19:44:27,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:27,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:27,093 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1670679926, now seen corresponding path program 130 times [2020-02-10 19:44:27,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133798091] [2020-02-10 19:44:27,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,299 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:27,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133798091] [2020-02-10 19:44:27,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:27,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062613285] [2020-02-10 19:44:27,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:27,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:27,301 INFO L87 Difference]: Start difference. First operand 341 states and 1078 transitions. Second operand 8 states. [2020-02-10 19:44:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,384 INFO L93 Difference]: Finished difference Result 668 states and 1863 transitions. [2020-02-10 19:44:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:27,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,386 INFO L225 Difference]: With dead ends: 668 [2020-02-10 19:44:27,386 INFO L226 Difference]: Without dead ends: 630 [2020-02-10 19:44:27,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-02-10 19:44:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 336. [2020-02-10 19:44:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-02-10 19:44:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1064 transitions. [2020-02-10 19:44:27,394 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1064 transitions. Word has length 19 [2020-02-10 19:44:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,395 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 1064 transitions. [2020-02-10 19:44:27,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1064 transitions. [2020-02-10 19:44:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:27,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:27,396 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash 400559450, now seen corresponding path program 131 times [2020-02-10 19:44:27,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271780922] [2020-02-10 19:44:27,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,617 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:27,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271780922] [2020-02-10 19:44:27,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:27,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702855439] [2020-02-10 19:44:27,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:27,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:27,618 INFO L87 Difference]: Start difference. First operand 336 states and 1064 transitions. Second operand 8 states. [2020-02-10 19:44:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,699 INFO L93 Difference]: Finished difference Result 688 states and 1931 transitions. [2020-02-10 19:44:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:27,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,700 INFO L225 Difference]: With dead ends: 688 [2020-02-10 19:44:27,700 INFO L226 Difference]: Without dead ends: 648 [2020-02-10 19:44:27,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-02-10 19:44:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 345. [2020-02-10 19:44:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-02-10 19:44:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1086 transitions. [2020-02-10 19:44:27,708 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1086 transitions. Word has length 19 [2020-02-10 19:44:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,708 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 1086 transitions. [2020-02-10 19:44:27,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1086 transitions. [2020-02-10 19:44:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:27,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:27,709 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash 399964804, now seen corresponding path program 132 times [2020-02-10 19:44:27,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484406450] [2020-02-10 19:44:27,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,931 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:27,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484406450] [2020-02-10 19:44:27,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:27,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124892658] [2020-02-10 19:44:27,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:27,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:27,933 INFO L87 Difference]: Start difference. First operand 345 states and 1086 transitions. Second operand 8 states. [2020-02-10 19:44:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,014 INFO L93 Difference]: Finished difference Result 681 states and 1901 transitions. [2020-02-10 19:44:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:28,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,016 INFO L225 Difference]: With dead ends: 681 [2020-02-10 19:44:28,016 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:44:28,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:44:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 330. [2020-02-10 19:44:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 19:44:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1048 transitions. [2020-02-10 19:44:28,024 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1048 transitions. Word has length 19 [2020-02-10 19:44:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,024 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1048 transitions. [2020-02-10 19:44:28,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1048 transitions. [2020-02-10 19:44:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:28,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:28,025 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 390118730, now seen corresponding path program 133 times [2020-02-10 19:44:28,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981379457] [2020-02-10 19:44:28,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,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:28,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981379457] [2020-02-10 19:44:28,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:28,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727545673] [2020-02-10 19:44:28,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:28,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:28,235 INFO L87 Difference]: Start difference. First operand 330 states and 1048 transitions. Second operand 8 states. [2020-02-10 19:44:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,300 INFO L93 Difference]: Finished difference Result 658 states and 1838 transitions. [2020-02-10 19:44:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:28,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,302 INFO L225 Difference]: With dead ends: 658 [2020-02-10 19:44:28,302 INFO L226 Difference]: Without dead ends: 627 [2020-02-10 19:44:28,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-02-10 19:44:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 340. [2020-02-10 19:44:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-02-10 19:44:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1076 transitions. [2020-02-10 19:44:28,309 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1076 transitions. Word has length 19 [2020-02-10 19:44:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,309 INFO L479 AbstractCegarLoop]: Abstraction has 340 states and 1076 transitions. [2020-02-10 19:44:28,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1076 transitions. [2020-02-10 19:44:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:28,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:28,310 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash -360943364, now seen corresponding path program 134 times [2020-02-10 19:44:28,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955469626] [2020-02-10 19:44:28,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,563 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:28,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955469626] [2020-02-10 19:44:28,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:28,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471533478] [2020-02-10 19:44:28,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:28,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:28,564 INFO L87 Difference]: Start difference. First operand 340 states and 1076 transitions. Second operand 8 states. [2020-02-10 19:44:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,647 INFO L93 Difference]: Finished difference Result 660 states and 1842 transitions. [2020-02-10 19:44:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:28,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,649 INFO L225 Difference]: With dead ends: 660 [2020-02-10 19:44:28,649 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:44:28,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:44:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 335. [2020-02-10 19:44:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 19:44:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-02-10 19:44:28,656 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-02-10 19:44:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,656 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-02-10 19:44:28,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-02-10 19:44:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:28,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:28,657 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1210319124, now seen corresponding path program 135 times [2020-02-10 19:44:28,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622789762] [2020-02-10 19:44:28,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,867 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:28,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622789762] [2020-02-10 19:44:28,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:28,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584162038] [2020-02-10 19:44:28,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:28,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:28,868 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-02-10 19:44:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,931 INFO L93 Difference]: Finished difference Result 662 states and 1845 transitions. [2020-02-10 19:44:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:28,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,933 INFO L225 Difference]: With dead ends: 662 [2020-02-10 19:44:28,933 INFO L226 Difference]: Without dead ends: 631 [2020-02-10 19:44:28,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-02-10 19:44:28,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 341. [2020-02-10 19:44:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-02-10 19:44:28,940 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-02-10 19:44:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,940 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-02-10 19:44:28,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-02-10 19:44:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:28,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:28,941 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2108443422, now seen corresponding path program 136 times [2020-02-10 19:44:28,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542289783] [2020-02-10 19:44:28,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:29,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542289783] [2020-02-10 19:44:29,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:29,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744230743] [2020-02-10 19:44:29,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:29,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:29,169 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-02-10 19:44:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,284 INFO L93 Difference]: Finished difference Result 667 states and 1857 transitions. [2020-02-10 19:44:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:29,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,286 INFO L225 Difference]: With dead ends: 667 [2020-02-10 19:44:29,286 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:44:29,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:44:29,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 335. [2020-02-10 19:44:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 19:44:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1057 transitions. [2020-02-10 19:44:29,293 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1057 transitions. Word has length 19 [2020-02-10 19:44:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,293 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1057 transitions. [2020-02-10 19:44:29,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1057 transitions. [2020-02-10 19:44:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:29,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:29,294 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:29,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,295 INFO L82 PathProgramCache]: Analyzing trace with hash -558519542, now seen corresponding path program 137 times [2020-02-10 19:44:29,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735735171] [2020-02-10 19:44:29,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:29,506 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:29,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735735171] [2020-02-10 19:44:29,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:29,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252318510] [2020-02-10 19:44:29,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:29,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:29,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:29,509 INFO L87 Difference]: Start difference. First operand 335 states and 1057 transitions. Second operand 8 states. [2020-02-10 19:44:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,615 INFO L93 Difference]: Finished difference Result 668 states and 1869 transitions. [2020-02-10 19:44:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:29,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:29,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,617 INFO L225 Difference]: With dead ends: 668 [2020-02-10 19:44:29,617 INFO L226 Difference]: Without dead ends: 635 [2020-02-10 19:44:29,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-02-10 19:44:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 343. [2020-02-10 19:44:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 19:44:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1077 transitions. [2020-02-10 19:44:29,625 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1077 transitions. Word has length 19 [2020-02-10 19:44:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,625 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1077 transitions. [2020-02-10 19:44:29,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1077 transitions. [2020-02-10 19:44:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:29,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:29,626 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash 300354988, now seen corresponding path program 138 times [2020-02-10 19:44:29,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200289955] [2020-02-10 19:44:29,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:29,842 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:29,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200289955] [2020-02-10 19:44:29,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:29,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402712967] [2020-02-10 19:44:29,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:29,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:29,844 INFO L87 Difference]: Start difference. First operand 343 states and 1077 transitions. Second operand 8 states. [2020-02-10 19:44:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,938 INFO L93 Difference]: Finished difference Result 671 states and 1870 transitions. [2020-02-10 19:44:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:29,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,940 INFO L225 Difference]: With dead ends: 671 [2020-02-10 19:44:29,940 INFO L226 Difference]: Without dead ends: 622 [2020-02-10 19:44:29,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-02-10 19:44:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 330. [2020-02-10 19:44:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-02-10 19:44:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1043 transitions. [2020-02-10 19:44:29,948 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1043 transitions. Word has length 19 [2020-02-10 19:44:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,948 INFO L479 AbstractCegarLoop]: Abstraction has 330 states and 1043 transitions. [2020-02-10 19:44:29,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1043 transitions. [2020-02-10 19:44:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:29,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:29,949 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2132260642, now seen corresponding path program 139 times [2020-02-10 19:44:29,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106321006] [2020-02-10 19:44:29,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,150 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:30,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106321006] [2020-02-10 19:44:30,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:30,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11950927] [2020-02-10 19:44:30,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:30,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:30,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:30,152 INFO L87 Difference]: Start difference. First operand 330 states and 1043 transitions. Second operand 8 states. [2020-02-10 19:44:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,234 INFO L93 Difference]: Finished difference Result 702 states and 2000 transitions. [2020-02-10 19:44:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:30,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,236 INFO L225 Difference]: With dead ends: 702 [2020-02-10 19:44:30,236 INFO L226 Difference]: Without dead ends: 662 [2020-02-10 19:44:30,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-02-10 19:44:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 347. [2020-02-10 19:44:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1101 transitions. [2020-02-10 19:44:30,242 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1101 transitions. Word has length 19 [2020-02-10 19:44:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,243 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1101 transitions. [2020-02-10 19:44:30,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1101 transitions. [2020-02-10 19:44:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:30,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:30,243 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:30,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2132855288, now seen corresponding path program 140 times [2020-02-10 19:44:30,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612443665] [2020-02-10 19:44:30,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,458 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:30,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612443665] [2020-02-10 19:44:30,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:30,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692773111] [2020-02-10 19:44:30,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:30,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:30,460 INFO L87 Difference]: Start difference. First operand 347 states and 1101 transitions. Second operand 8 states. [2020-02-10 19:44:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,553 INFO L93 Difference]: Finished difference Result 695 states and 1970 transitions. [2020-02-10 19:44:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:30,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,555 INFO L225 Difference]: With dead ends: 695 [2020-02-10 19:44:30,555 INFO L226 Difference]: Without dead ends: 653 [2020-02-10 19:44:30,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-02-10 19:44:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 338. [2020-02-10 19:44:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 19:44:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1071 transitions. [2020-02-10 19:44:30,562 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1071 transitions. Word has length 19 [2020-02-10 19:44:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,562 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1071 transitions. [2020-02-10 19:44:30,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1071 transitions. [2020-02-10 19:44:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:30,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:30,563 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:30,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1276953988, now seen corresponding path program 141 times [2020-02-10 19:44:30,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140195539] [2020-02-10 19:44:30,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,776 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:30,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140195539] [2020-02-10 19:44:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:30,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931653604] [2020-02-10 19:44:30,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:30,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:30,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:30,777 INFO L87 Difference]: Start difference. First operand 338 states and 1071 transitions. Second operand 8 states. [2020-02-10 19:44:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,866 INFO L93 Difference]: Finished difference Result 708 states and 2013 transitions. [2020-02-10 19:44:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:30,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,868 INFO L225 Difference]: With dead ends: 708 [2020-02-10 19:44:30,868 INFO L226 Difference]: Without dead ends: 668 [2020-02-10 19:44:30,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-02-10 19:44:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 350. [2020-02-10 19:44:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-02-10 19:44:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1102 transitions. [2020-02-10 19:44:30,876 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1102 transitions. Word has length 19 [2020-02-10 19:44:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,877 INFO L479 AbstractCegarLoop]: Abstraction has 350 states and 1102 transitions. [2020-02-10 19:44:30,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1102 transitions. [2020-02-10 19:44:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:30,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:30,878 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash -418674104, now seen corresponding path program 142 times [2020-02-10 19:44:30,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289424750] [2020-02-10 19:44:30,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,086 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:31,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289424750] [2020-02-10 19:44:31,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:31,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437889796] [2020-02-10 19:44:31,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:31,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:31,088 INFO L87 Difference]: Start difference. First operand 350 states and 1102 transitions. Second operand 8 states. [2020-02-10 19:44:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,189 INFO L93 Difference]: Finished difference Result 704 states and 1989 transitions. [2020-02-10 19:44:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:31,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,190 INFO L225 Difference]: With dead ends: 704 [2020-02-10 19:44:31,191 INFO L226 Difference]: Without dead ends: 656 [2020-02-10 19:44:31,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-02-10 19:44:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 338. [2020-02-10 19:44:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-02-10 19:44:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1063 transitions. [2020-02-10 19:44:31,200 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1063 transitions. Word has length 19 [2020-02-10 19:44:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,200 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 1063 transitions. [2020-02-10 19:44:31,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1063 transitions. [2020-02-10 19:44:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:31,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:31,201 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1295982660, now seen corresponding path program 143 times [2020-02-10 19:44:31,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897202198] [2020-02-10 19:44:31,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,411 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:31,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897202198] [2020-02-10 19:44:31,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:31,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310064229] [2020-02-10 19:44:31,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:31,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:31,412 INFO L87 Difference]: Start difference. First operand 338 states and 1063 transitions. Second operand 8 states. [2020-02-10 19:44:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,500 INFO L93 Difference]: Finished difference Result 690 states and 1948 transitions. [2020-02-10 19:44:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:31,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,502 INFO L225 Difference]: With dead ends: 690 [2020-02-10 19:44:31,502 INFO L226 Difference]: Without dead ends: 657 [2020-02-10 19:44:31,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-02-10 19:44:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 346. [2020-02-10 19:44:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-02-10 19:44:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1083 transitions. [2020-02-10 19:44:31,509 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1083 transitions. Word has length 19 [2020-02-10 19:44:31,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,510 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 1083 transitions. [2020-02-10 19:44:31,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1083 transitions. [2020-02-10 19:44:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:31,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:31,511 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,511 INFO L82 PathProgramCache]: Analyzing trace with hash -437108130, now seen corresponding path program 144 times [2020-02-10 19:44:31,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498254954] [2020-02-10 19:44:31,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:31,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498254954] [2020-02-10 19:44:31,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:31,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159053354] [2020-02-10 19:44:31,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:31,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:31,716 INFO L87 Difference]: Start difference. First operand 346 states and 1083 transitions. Second operand 8 states. [2020-02-10 19:44:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,806 INFO L93 Difference]: Finished difference Result 693 states and 1949 transitions. [2020-02-10 19:44:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:31,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,808 INFO L225 Difference]: With dead ends: 693 [2020-02-10 19:44:31,808 INFO L226 Difference]: Without dead ends: 633 [2020-02-10 19:44:31,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-02-10 19:44:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 322. [2020-02-10 19:44:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-02-10 19:44:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1025 transitions. [2020-02-10 19:44:31,815 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1025 transitions. Word has length 19 [2020-02-10 19:44:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,816 INFO L479 AbstractCegarLoop]: Abstraction has 322 states and 1025 transitions. [2020-02-10 19:44:31,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1025 transitions. [2020-02-10 19:44:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:31,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:31,816 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:31,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash -570692880, now seen corresponding path program 145 times [2020-02-10 19:44:31,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21772596] [2020-02-10 19:44:31,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,041 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:32,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21772596] [2020-02-10 19:44:32,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:32,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347880348] [2020-02-10 19:44:32,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:32,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:32,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:32,042 INFO L87 Difference]: Start difference. First operand 322 states and 1025 transitions. Second operand 8 states. [2020-02-10 19:44:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:32,120 INFO L93 Difference]: Finished difference Result 656 states and 1808 transitions. [2020-02-10 19:44:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:32,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:32,121 INFO L225 Difference]: With dead ends: 656 [2020-02-10 19:44:32,121 INFO L226 Difference]: Without dead ends: 625 [2020-02-10 19:44:32,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-02-10 19:44:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 343. [2020-02-10 19:44:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-02-10 19:44:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1083 transitions. [2020-02-10 19:44:32,131 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1083 transitions. Word has length 19 [2020-02-10 19:44:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,131 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 1083 transitions. [2020-02-10 19:44:32,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1083 transitions. [2020-02-10 19:44:32,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:32,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:32,132 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash -196041694, now seen corresponding path program 146 times [2020-02-10 19:44:32,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690375126] [2020-02-10 19:44:32,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,342 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:32,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690375126] [2020-02-10 19:44:32,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:32,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881858498] [2020-02-10 19:44:32,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:32,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:32,344 INFO L87 Difference]: Start difference. First operand 343 states and 1083 transitions. Second operand 8 states. [2020-02-10 19:44:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:32,429 INFO L93 Difference]: Finished difference Result 665 states and 1831 transitions. [2020-02-10 19:44:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:32,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:32,430 INFO L225 Difference]: With dead ends: 665 [2020-02-10 19:44:32,431 INFO L226 Difference]: Without dead ends: 617 [2020-02-10 19:44:32,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-02-10 19:44:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 335. [2020-02-10 19:44:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 19:44:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-02-10 19:44:32,438 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-02-10 19:44:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,438 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-02-10 19:44:32,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-02-10 19:44:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:32,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:32,439 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:32,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,439 INFO L82 PathProgramCache]: Analyzing trace with hash 610696874, now seen corresponding path program 147 times [2020-02-10 19:44:32,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742313872] [2020-02-10 19:44:32,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,661 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:32,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742313872] [2020-02-10 19:44:32,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:32,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790366572] [2020-02-10 19:44:32,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:32,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:32,662 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-02-10 19:44:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:32,733 INFO L93 Difference]: Finished difference Result 650 states and 1785 transitions. [2020-02-10 19:44:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:32,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:32,734 INFO L225 Difference]: With dead ends: 650 [2020-02-10 19:44:32,734 INFO L226 Difference]: Without dead ends: 619 [2020-02-10 19:44:32,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-02-10 19:44:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-02-10 19:44:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-02-10 19:44:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-02-10 19:44:32,742 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-02-10 19:44:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,742 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-02-10 19:44:32,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-02-10 19:44:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:32,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:32,743 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:32,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,743 INFO L82 PathProgramCache]: Analyzing trace with hash -365507876, now seen corresponding path program 148 times [2020-02-10 19:44:32,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989127569] [2020-02-10 19:44:32,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:32,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989127569] [2020-02-10 19:44:32,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:32,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966203729] [2020-02-10 19:44:32,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:32,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:32,950 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-02-10 19:44:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,041 INFO L93 Difference]: Finished difference Result 655 states and 1797 transitions. [2020-02-10 19:44:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:33,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,042 INFO L225 Difference]: With dead ends: 655 [2020-02-10 19:44:33,042 INFO L226 Difference]: Without dead ends: 613 [2020-02-10 19:44:33,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-02-10 19:44:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 335. [2020-02-10 19:44:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-02-10 19:44:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1056 transitions. [2020-02-10 19:44:33,052 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1056 transitions. Word has length 19 [2020-02-10 19:44:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,052 INFO L479 AbstractCegarLoop]: Abstraction has 335 states and 1056 transitions. [2020-02-10 19:44:33,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1056 transitions. [2020-02-10 19:44:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:33,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:33,053 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1800464414, now seen corresponding path program 149 times [2020-02-10 19:44:33,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494942824] [2020-02-10 19:44:33,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:33,330 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:33,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494942824] [2020-02-10 19:44:33,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:33,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:33,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638269184] [2020-02-10 19:44:33,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:33,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:33,333 INFO L87 Difference]: Start difference. First operand 335 states and 1056 transitions. Second operand 8 states. [2020-02-10 19:44:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,462 INFO L93 Difference]: Finished difference Result 674 states and 1865 transitions. [2020-02-10 19:44:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:33,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,465 INFO L225 Difference]: With dead ends: 674 [2020-02-10 19:44:33,465 INFO L226 Difference]: Without dead ends: 634 [2020-02-10 19:44:33,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-02-10 19:44:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 347. [2020-02-10 19:44:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-02-10 19:44:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1087 transitions. [2020-02-10 19:44:33,475 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1087 transitions. Word has length 19 [2020-02-10 19:44:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,476 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 1087 transitions. [2020-02-10 19:44:33,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1087 transitions. [2020-02-10 19:44:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:33,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:33,478 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:33,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1636222998, now seen corresponding path program 150 times [2020-02-10 19:44:33,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754573614] [2020-02-10 19:44:33,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:33,750 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:33,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754573614] [2020-02-10 19:44:33,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:33,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:33,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625258115] [2020-02-10 19:44:33,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:33,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:33,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:33,752 INFO L87 Difference]: Start difference. First operand 347 states and 1087 transitions. Second operand 8 states. [2020-02-10 19:44:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,843 INFO L93 Difference]: Finished difference Result 670 states and 1841 transitions. [2020-02-10 19:44:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:33,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,845 INFO L225 Difference]: With dead ends: 670 [2020-02-10 19:44:33,845 INFO L226 Difference]: Without dead ends: 614 [2020-02-10 19:44:33,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-02-10 19:44:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 327. [2020-02-10 19:44:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-02-10 19:44:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1038 transitions. [2020-02-10 19:44:33,855 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1038 transitions. Word has length 19 [2020-02-10 19:44:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,855 INFO L479 AbstractCegarLoop]: Abstraction has 327 states and 1038 transitions. [2020-02-10 19:44:33,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1038 transitions. [2020-02-10 19:44:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:33,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:33,857 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 807035554, now seen corresponding path program 151 times [2020-02-10 19:44:33,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362273919] [2020-02-10 19:44:33,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,113 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:34,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362273919] [2020-02-10 19:44:34,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:34,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374479772] [2020-02-10 19:44:34,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:34,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:34,114 INFO L87 Difference]: Start difference. First operand 327 states and 1038 transitions. Second operand 8 states. [2020-02-10 19:44:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,178 INFO L93 Difference]: Finished difference Result 629 states and 1714 transitions. [2020-02-10 19:44:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:34,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,180 INFO L225 Difference]: With dead ends: 629 [2020-02-10 19:44:34,180 INFO L226 Difference]: Without dead ends: 598 [2020-02-10 19:44:34,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-02-10 19:44:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 339. [2020-02-10 19:44:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-02-10 19:44:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1064 transitions. [2020-02-10 19:44:34,187 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1064 transitions. Word has length 19 [2020-02-10 19:44:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,187 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 1064 transitions. [2020-02-10 19:44:34,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1064 transitions. [2020-02-10 19:44:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:34,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:34,188 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1181686740, now seen corresponding path program 152 times [2020-02-10 19:44:34,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356909696] [2020-02-10 19:44:34,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,385 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:34,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356909696] [2020-02-10 19:44:34,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:34,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692782773] [2020-02-10 19:44:34,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:34,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:34,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:34,394 INFO L87 Difference]: Start difference. First operand 339 states and 1064 transitions. Second operand 8 states. [2020-02-10 19:44:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,476 INFO L93 Difference]: Finished difference Result 638 states and 1737 transitions. [2020-02-10 19:44:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:34,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,478 INFO L225 Difference]: With dead ends: 638 [2020-02-10 19:44:34,478 INFO L226 Difference]: Without dead ends: 590 [2020-02-10 19:44:34,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-02-10 19:44:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 331. [2020-02-10 19:44:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-02-10 19:44:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1046 transitions. [2020-02-10 19:44:34,485 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1046 transitions. Word has length 19 [2020-02-10 19:44:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,485 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 1046 transitions. [2020-02-10 19:44:34,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1046 transitions. [2020-02-10 19:44:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:34,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:34,486 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:34,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1337232860, now seen corresponding path program 153 times [2020-02-10 19:44:34,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427452039] [2020-02-10 19:44:34,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,673 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:34,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427452039] [2020-02-10 19:44:34,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:34,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017129264] [2020-02-10 19:44:34,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:34,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:34,674 INFO L87 Difference]: Start difference. First operand 331 states and 1046 transitions. Second operand 8 states. [2020-02-10 19:44:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,746 INFO L93 Difference]: Finished difference Result 606 states and 1650 transitions. [2020-02-10 19:44:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:34,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,747 INFO L225 Difference]: With dead ends: 606 [2020-02-10 19:44:34,747 INFO L226 Difference]: Without dead ends: 575 [2020-02-10 19:44:34,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-02-10 19:44:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 334. [2020-02-10 19:44:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-02-10 19:44:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1050 transitions. [2020-02-10 19:44:34,754 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1050 transitions. Word has length 19 [2020-02-10 19:44:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,754 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 1050 transitions. [2020-02-10 19:44:34,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1050 transitions. [2020-02-10 19:44:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:34,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:34,755 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1693132272, now seen corresponding path program 1 times [2020-02-10 19:44:34,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467441995] [2020-02-10 19:44:34,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,766 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:34,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467441995] [2020-02-10 19:44:34,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:44:34,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256713423] [2020-02-10 19:44:34,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:44:34,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:44:34,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:34,768 INFO L87 Difference]: Start difference. First operand 334 states and 1050 transitions. Second operand 3 states. [2020-02-10 19:44:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,771 INFO L93 Difference]: Finished difference Result 220 states and 662 transitions. [2020-02-10 19:44:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:44:34,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-02-10 19:44:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,772 INFO L225 Difference]: With dead ends: 220 [2020-02-10 19:44:34,772 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 19:44:34,772 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:44:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 19:44:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-02-10 19:44:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 19:44:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 662 transitions. [2020-02-10 19:44:34,777 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 662 transitions. Word has length 19 [2020-02-10 19:44:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,777 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 662 transitions. [2020-02-10 19:44:34,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 662 transitions. [2020-02-10 19:44:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:34,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:34,778 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1596291086, now seen corresponding path program 154 times [2020-02-10 19:44:34,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474765527] [2020-02-10 19:44:34,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,987 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:34,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474765527] [2020-02-10 19:44:34,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:34,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773989937] [2020-02-10 19:44:34,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:34,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:34,988 INFO L87 Difference]: Start difference. First operand 220 states and 662 transitions. Second operand 8 states. [2020-02-10 19:44:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,066 INFO L93 Difference]: Finished difference Result 336 states and 884 transitions. [2020-02-10 19:44:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:35,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,068 INFO L225 Difference]: With dead ends: 336 [2020-02-10 19:44:35,068 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 19:44:35,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 19:44:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 217. [2020-02-10 19:44:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-02-10 19:44:35,077 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-02-10 19:44:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,077 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-02-10 19:44:35,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-02-10 19:44:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:35,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:35,078 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1035428716, now seen corresponding path program 155 times [2020-02-10 19:44:35,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025473516] [2020-02-10 19:44:35,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,311 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:35,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025473516] [2020-02-10 19:44:35,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:35,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460357473] [2020-02-10 19:44:35,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:35,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:35,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:35,314 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-02-10 19:44:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,408 INFO L93 Difference]: Finished difference Result 348 states and 900 transitions. [2020-02-10 19:44:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:35,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,410 INFO L225 Difference]: With dead ends: 348 [2020-02-10 19:44:35,410 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 19:44:35,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 19:44:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 219. [2020-02-10 19:44:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 19:44:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 658 transitions. [2020-02-10 19:44:35,416 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 658 transitions. Word has length 19 [2020-02-10 19:44:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,416 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 658 transitions. [2020-02-10 19:44:35,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 658 transitions. [2020-02-10 19:44:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:35,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:35,417 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash 84701114, now seen corresponding path program 156 times [2020-02-10 19:44:35,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076426266] [2020-02-10 19:44:35,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:35,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076426266] [2020-02-10 19:44:35,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:35,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288380426] [2020-02-10 19:44:35,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:35,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:35,614 INFO L87 Difference]: Start difference. First operand 219 states and 658 transitions. Second operand 8 states. [2020-02-10 19:44:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,677 INFO L93 Difference]: Finished difference Result 335 states and 880 transitions. [2020-02-10 19:44:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:35,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,678 INFO L225 Difference]: With dead ends: 335 [2020-02-10 19:44:35,678 INFO L226 Difference]: Without dead ends: 319 [2020-02-10 19:44:35,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-02-10 19:44:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 213. [2020-02-10 19:44:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 19:44:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 646 transitions. [2020-02-10 19:44:35,684 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 646 transitions. Word has length 19 [2020-02-10 19:44:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,684 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 646 transitions. [2020-02-10 19:44:35,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 646 transitions. [2020-02-10 19:44:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:35,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:35,685 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:35,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,685 INFO L82 PathProgramCache]: Analyzing trace with hash -694390430, now seen corresponding path program 157 times [2020-02-10 19:44:35,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273242668] [2020-02-10 19:44:35,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,881 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:35,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273242668] [2020-02-10 19:44:35,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:35,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541352636] [2020-02-10 19:44:35,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:35,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:35,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:35,883 INFO L87 Difference]: Start difference. First operand 213 states and 646 transitions. Second operand 8 states. [2020-02-10 19:44:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,960 INFO L93 Difference]: Finished difference Result 363 states and 936 transitions. [2020-02-10 19:44:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:35,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,961 INFO L225 Difference]: With dead ends: 363 [2020-02-10 19:44:35,961 INFO L226 Difference]: Without dead ends: 347 [2020-02-10 19:44:35,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-02-10 19:44:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2020-02-10 19:44:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 19:44:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-02-10 19:44:35,966 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-02-10 19:44:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,966 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-02-10 19:44:35,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-02-10 19:44:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:35,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:35,967 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash -435332204, now seen corresponding path program 158 times [2020-02-10 19:44:35,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208504761] [2020-02-10 19:44:35,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,172 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:36,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208504761] [2020-02-10 19:44:36,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:36,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782384409] [2020-02-10 19:44:36,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:36,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:36,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:36,174 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-02-10 19:44:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,244 INFO L93 Difference]: Finished difference Result 357 states and 921 transitions. [2020-02-10 19:44:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:36,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,246 INFO L225 Difference]: With dead ends: 357 [2020-02-10 19:44:36,246 INFO L226 Difference]: Without dead ends: 344 [2020-02-10 19:44:36,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-02-10 19:44:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 216. [2020-02-10 19:44:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-02-10 19:44:36,252 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-02-10 19:44:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,252 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-02-10 19:44:36,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-02-10 19:44:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:36,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:36,252 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:36,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash 399701158, now seen corresponding path program 159 times [2020-02-10 19:44:36,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43412806] [2020-02-10 19:44:36,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,455 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:36,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43412806] [2020-02-10 19:44:36,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:36,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657365571] [2020-02-10 19:44:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:36,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:36,456 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-02-10 19:44:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,523 INFO L93 Difference]: Finished difference Result 363 states and 933 transitions. [2020-02-10 19:44:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:36,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,524 INFO L225 Difference]: With dead ends: 363 [2020-02-10 19:44:36,525 INFO L226 Difference]: Without dead ends: 347 [2020-02-10 19:44:36,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-02-10 19:44:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 222. [2020-02-10 19:44:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 19:44:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 664 transitions. [2020-02-10 19:44:36,529 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 664 transitions. Word has length 19 [2020-02-10 19:44:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,530 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 664 transitions. [2020-02-10 19:44:36,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 664 transitions. [2020-02-10 19:44:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:36,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:36,530 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash -576503592, now seen corresponding path program 160 times [2020-02-10 19:44:36,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467608903] [2020-02-10 19:44:36,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,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:44:36,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467608903] [2020-02-10 19:44:36,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:36,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448126547] [2020-02-10 19:44:36,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:36,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:36,734 INFO L87 Difference]: Start difference. First operand 222 states and 664 transitions. Second operand 8 states. [2020-02-10 19:44:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,825 INFO L93 Difference]: Finished difference Result 360 states and 922 transitions. [2020-02-10 19:44:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:36,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,826 INFO L225 Difference]: With dead ends: 360 [2020-02-10 19:44:36,826 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 19:44:36,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 19:44:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 216. [2020-02-10 19:44:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2020-02-10 19:44:36,831 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2020-02-10 19:44:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,831 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2020-02-10 19:44:36,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2020-02-10 19:44:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:36,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:36,832 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1883903552, now seen corresponding path program 161 times [2020-02-10 19:44:36,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618063688] [2020-02-10 19:44:36,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:37,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618063688] [2020-02-10 19:44:37,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:37,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010822843] [2020-02-10 19:44:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:37,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:37,037 INFO L87 Difference]: Start difference. First operand 216 states and 650 transitions. Second operand 8 states. [2020-02-10 19:44:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,102 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-02-10 19:44:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:37,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,104 INFO L225 Difference]: With dead ends: 347 [2020-02-10 19:44:37,104 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 19:44:37,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 19:44:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 218. [2020-02-10 19:44:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-02-10 19:44:37,109 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-02-10 19:44:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,109 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-02-10 19:44:37,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-02-10 19:44:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:37,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:37,110 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash -394498556, now seen corresponding path program 162 times [2020-02-10 19:44:37,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399921866] [2020-02-10 19:44:37,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,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:44:37,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399921866] [2020-02-10 19:44:37,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:37,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197765970] [2020-02-10 19:44:37,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:37,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:37,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:37,308 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-02-10 19:44:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,399 INFO L93 Difference]: Finished difference Result 345 states and 889 transitions. [2020-02-10 19:44:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:37,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,400 INFO L225 Difference]: With dead ends: 345 [2020-02-10 19:44:37,400 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 19:44:37,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 19:44:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2020-02-10 19:44:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 19:44:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 643 transitions. [2020-02-10 19:44:37,406 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 643 transitions. Word has length 19 [2020-02-10 19:44:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,406 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 643 transitions. [2020-02-10 19:44:37,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 643 transitions. [2020-02-10 19:44:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:37,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:37,407 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 600573882, now seen corresponding path program 163 times [2020-02-10 19:44:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39035188] [2020-02-10 19:44:37,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,593 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:37,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39035188] [2020-02-10 19:44:37,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:37,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825670841] [2020-02-10 19:44:37,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:37,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:37,595 INFO L87 Difference]: Start difference. First operand 213 states and 643 transitions. Second operand 8 states. [2020-02-10 19:44:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,679 INFO L93 Difference]: Finished difference Result 353 states and 915 transitions. [2020-02-10 19:44:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:37,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,680 INFO L225 Difference]: With dead ends: 353 [2020-02-10 19:44:37,680 INFO L226 Difference]: Without dead ends: 339 [2020-02-10 19:44:37,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-02-10 19:44:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 217. [2020-02-10 19:44:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 653 transitions. [2020-02-10 19:44:37,686 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 653 transitions. Word has length 19 [2020-02-10 19:44:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,686 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 653 transitions. [2020-02-10 19:44:37,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 653 transitions. [2020-02-10 19:44:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:37,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:37,687 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1720703712, now seen corresponding path program 164 times [2020-02-10 19:44:37,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530334846] [2020-02-10 19:44:37,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,893 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:37,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530334846] [2020-02-10 19:44:37,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:37,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510421219] [2020-02-10 19:44:37,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:37,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:37,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:37,895 INFO L87 Difference]: Start difference. First operand 217 states and 653 transitions. Second operand 8 states. [2020-02-10 19:44:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,970 INFO L93 Difference]: Finished difference Result 349 states and 904 transitions. [2020-02-10 19:44:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:37,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,971 INFO L225 Difference]: With dead ends: 349 [2020-02-10 19:44:37,971 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 19:44:37,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 19:44:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 215. [2020-02-10 19:44:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 19:44:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 648 transitions. [2020-02-10 19:44:37,976 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 648 transitions. Word has length 19 [2020-02-10 19:44:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,976 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 648 transitions. [2020-02-10 19:44:37,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 648 transitions. [2020-02-10 19:44:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:37,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:37,977 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:37,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,977 INFO L82 PathProgramCache]: Analyzing trace with hash -472511498, now seen corresponding path program 165 times [2020-02-10 19:44:37,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484408218] [2020-02-10 19:44:37,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,169 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:38,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484408218] [2020-02-10 19:44:38,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:38,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395089828] [2020-02-10 19:44:38,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:38,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:38,171 INFO L87 Difference]: Start difference. First operand 215 states and 648 transitions. Second operand 8 states. [2020-02-10 19:44:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,251 INFO L93 Difference]: Finished difference Result 354 states and 915 transitions. [2020-02-10 19:44:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:38,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,252 INFO L225 Difference]: With dead ends: 354 [2020-02-10 19:44:38,252 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 19:44:38,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 19:44:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-02-10 19:44:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 19:44:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 658 transitions. [2020-02-10 19:44:38,257 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 658 transitions. Word has length 19 [2020-02-10 19:44:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,257 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 658 transitions. [2020-02-10 19:44:38,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 658 transitions. [2020-02-10 19:44:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:38,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:38,258 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1114568416, now seen corresponding path program 166 times [2020-02-10 19:44:38,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126943140] [2020-02-10 19:44:38,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,457 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:38,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126943140] [2020-02-10 19:44:38,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:38,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691257129] [2020-02-10 19:44:38,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:38,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:38,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:38,458 INFO L87 Difference]: Start difference. First operand 220 states and 658 transitions. Second operand 8 states. [2020-02-10 19:44:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,546 INFO L93 Difference]: Finished difference Result 353 states and 908 transitions. [2020-02-10 19:44:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:38,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,547 INFO L225 Difference]: With dead ends: 353 [2020-02-10 19:44:38,548 INFO L226 Difference]: Without dead ends: 335 [2020-02-10 19:44:38,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-02-10 19:44:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-02-10 19:44:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 19:44:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 646 transitions. [2020-02-10 19:44:38,554 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 646 transitions. Word has length 19 [2020-02-10 19:44:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,554 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 646 transitions. [2020-02-10 19:44:38,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 646 transitions. [2020-02-10 19:44:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:38,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:38,555 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1498552428, now seen corresponding path program 167 times [2020-02-10 19:44:38,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340165520] [2020-02-10 19:44:38,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,758 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:38,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340165520] [2020-02-10 19:44:38,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:38,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717456929] [2020-02-10 19:44:38,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:38,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:38,760 INFO L87 Difference]: Start difference. First operand 215 states and 646 transitions. Second operand 8 states. [2020-02-10 19:44:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,836 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-02-10 19:44:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:38,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,837 INFO L225 Difference]: With dead ends: 343 [2020-02-10 19:44:38,837 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 19:44:38,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 19:44:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 217. [2020-02-10 19:44:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 649 transitions. [2020-02-10 19:44:38,842 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 649 transitions. Word has length 19 [2020-02-10 19:44:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,843 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 649 transitions. [2020-02-10 19:44:38,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 649 transitions. [2020-02-10 19:44:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:38,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:38,843 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:38,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash -9147432, now seen corresponding path program 168 times [2020-02-10 19:44:38,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351757449] [2020-02-10 19:44:38,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,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:39,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351757449] [2020-02-10 19:44:39,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:39,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674065646] [2020-02-10 19:44:39,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:39,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:39,041 INFO L87 Difference]: Start difference. First operand 217 states and 649 transitions. Second operand 8 states. [2020-02-10 19:44:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:39,129 INFO L93 Difference]: Finished difference Result 341 states and 880 transitions. [2020-02-10 19:44:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:39,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:39,130 INFO L225 Difference]: With dead ends: 341 [2020-02-10 19:44:39,130 INFO L226 Difference]: Without dead ends: 319 [2020-02-10 19:44:39,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-02-10 19:44:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 208. [2020-02-10 19:44:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 19:44:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 632 transitions. [2020-02-10 19:44:39,136 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 632 transitions. Word has length 19 [2020-02-10 19:44:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:39,136 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 632 transitions. [2020-02-10 19:44:39,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 632 transitions. [2020-02-10 19:44:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:39,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:39,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:39,137 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1927068432, now seen corresponding path program 169 times [2020-02-10 19:44:39,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:39,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323618346] [2020-02-10 19:44:39,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,400 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:39,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323618346] [2020-02-10 19:44:39,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:39,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260104356] [2020-02-10 19:44:39,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:39,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:39,402 INFO L87 Difference]: Start difference. First operand 208 states and 632 transitions. Second operand 8 states. [2020-02-10 19:44:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:39,470 INFO L93 Difference]: Finished difference Result 378 states and 982 transitions. [2020-02-10 19:44:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:39,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:39,471 INFO L225 Difference]: With dead ends: 378 [2020-02-10 19:44:39,471 INFO L226 Difference]: Without dead ends: 362 [2020-02-10 19:44:39,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-02-10 19:44:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 224. [2020-02-10 19:44:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-02-10 19:44:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 674 transitions. [2020-02-10 19:44:39,478 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 674 transitions. Word has length 19 [2020-02-10 19:44:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:39,479 INFO L479 AbstractCegarLoop]: Abstraction has 224 states and 674 transitions. [2020-02-10 19:44:39,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 674 transitions. [2020-02-10 19:44:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:39,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:39,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:39,480 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1552417246, now seen corresponding path program 170 times [2020-02-10 19:44:39,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:39,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452843760] [2020-02-10 19:44:39,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,678 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:39,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452843760] [2020-02-10 19:44:39,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:39,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538959444] [2020-02-10 19:44:39,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:39,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:39,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:39,679 INFO L87 Difference]: Start difference. First operand 224 states and 674 transitions. Second operand 8 states. [2020-02-10 19:44:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:39,759 INFO L93 Difference]: Finished difference Result 376 states and 972 transitions. [2020-02-10 19:44:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:39,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:39,760 INFO L225 Difference]: With dead ends: 376 [2020-02-10 19:44:39,760 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 19:44:39,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 19:44:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 216. [2020-02-10 19:44:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 656 transitions. [2020-02-10 19:44:39,765 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 656 transitions. Word has length 19 [2020-02-10 19:44:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:39,765 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 656 transitions. [2020-02-10 19:44:39,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 656 transitions. [2020-02-10 19:44:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:39,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:39,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:39,766 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1396871126, now seen corresponding path program 171 times [2020-02-10 19:44:39,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:39,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547369559] [2020-02-10 19:44:39,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,959 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:39,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547369559] [2020-02-10 19:44:39,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:39,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082514382] [2020-02-10 19:44:39,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:39,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:39,960 INFO L87 Difference]: Start difference. First operand 216 states and 656 transitions. Second operand 8 states. [2020-02-10 19:44:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,026 INFO L93 Difference]: Finished difference Result 369 states and 955 transitions. [2020-02-10 19:44:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:40,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,027 INFO L225 Difference]: With dead ends: 369 [2020-02-10 19:44:40,027 INFO L226 Difference]: Without dead ends: 353 [2020-02-10 19:44:40,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-02-10 19:44:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 219. [2020-02-10 19:44:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 19:44:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-02-10 19:44:40,033 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-02-10 19:44:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,033 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-02-10 19:44:40,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-02-10 19:44:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:40,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:40,034 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1137812900, now seen corresponding path program 172 times [2020-02-10 19:44:40,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527561308] [2020-02-10 19:44:40,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:40,302 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:40,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527561308] [2020-02-10 19:44:40,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:40,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:40,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988475143] [2020-02-10 19:44:40,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:40,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:40,304 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-02-10 19:44:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,398 INFO L93 Difference]: Finished difference Result 363 states and 940 transitions. [2020-02-10 19:44:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:40,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,400 INFO L225 Difference]: With dead ends: 363 [2020-02-10 19:44:40,400 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 19:44:40,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 19:44:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 216. [2020-02-10 19:44:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-02-10 19:44:40,409 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-02-10 19:44:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,410 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-02-10 19:44:40,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-02-10 19:44:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:40,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:40,411 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,412 INFO L82 PathProgramCache]: Analyzing trace with hash 525434594, now seen corresponding path program 173 times [2020-02-10 19:44:40,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351405456] [2020-02-10 19:44:40,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:40,668 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:40,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351405456] [2020-02-10 19:44:40,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:40,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:40,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802642544] [2020-02-10 19:44:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:40,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:40,671 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-02-10 19:44:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,795 INFO L93 Difference]: Finished difference Result 364 states and 944 transitions. [2020-02-10 19:44:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:40,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,797 INFO L225 Difference]: With dead ends: 364 [2020-02-10 19:44:40,797 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 19:44:40,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 19:44:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 218. [2020-02-10 19:44:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 656 transitions. [2020-02-10 19:44:40,807 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 656 transitions. Word has length 19 [2020-02-10 19:44:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,807 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 656 transitions. [2020-02-10 19:44:40,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 656 transitions. [2020-02-10 19:44:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:40,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:40,809 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1645564424, now seen corresponding path program 174 times [2020-02-10 19:44:40,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209741787] [2020-02-10 19:44:40,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,043 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:41,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209741787] [2020-02-10 19:44:41,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:41,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735271622] [2020-02-10 19:44:41,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:41,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:41,045 INFO L87 Difference]: Start difference. First operand 218 states and 656 transitions. Second operand 8 states. [2020-02-10 19:44:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,109 INFO L93 Difference]: Finished difference Result 360 states and 933 transitions. [2020-02-10 19:44:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:41,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,111 INFO L225 Difference]: With dead ends: 360 [2020-02-10 19:44:41,111 INFO L226 Difference]: Without dead ends: 344 [2020-02-10 19:44:41,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-02-10 19:44:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 212. [2020-02-10 19:44:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 644 transitions. [2020-02-10 19:44:41,117 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 644 transitions. Word has length 19 [2020-02-10 19:44:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,117 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 644 transitions. [2020-02-10 19:44:41,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 644 transitions. [2020-02-10 19:44:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:41,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:41,118 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1945413138, now seen corresponding path program 175 times [2020-02-10 19:44:41,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716819039] [2020-02-10 19:44:41,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,318 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:41,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716819039] [2020-02-10 19:44:41,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:41,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249339555] [2020-02-10 19:44:41,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:41,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:41,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:41,320 INFO L87 Difference]: Start difference. First operand 212 states and 644 transitions. Second operand 8 states. [2020-02-10 19:44:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,377 INFO L93 Difference]: Finished difference Result 380 states and 985 transitions. [2020-02-10 19:44:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:41,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,378 INFO L225 Difference]: With dead ends: 380 [2020-02-10 19:44:41,378 INFO L226 Difference]: Without dead ends: 364 [2020-02-10 19:44:41,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-02-10 19:44:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 226. [2020-02-10 19:44:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-02-10 19:44:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 679 transitions. [2020-02-10 19:44:41,385 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 679 transitions. Word has length 19 [2020-02-10 19:44:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,385 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 679 transitions. [2020-02-10 19:44:41,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 679 transitions. [2020-02-10 19:44:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:41,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:41,386 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1974902972, now seen corresponding path program 176 times [2020-02-10 19:44:41,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602691411] [2020-02-10 19:44:41,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,595 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:41,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602691411] [2020-02-10 19:44:41,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:41,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4265482] [2020-02-10 19:44:41,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:41,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:41,597 INFO L87 Difference]: Start difference. First operand 226 states and 679 transitions. Second operand 8 states. [2020-02-10 19:44:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,683 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-02-10 19:44:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:41,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,685 INFO L225 Difference]: With dead ends: 378 [2020-02-10 19:44:41,685 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 19:44:41,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 19:44:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 218. [2020-02-10 19:44:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 659 transitions. [2020-02-10 19:44:41,691 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 659 transitions. Word has length 19 [2020-02-10 19:44:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,691 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 659 transitions. [2020-02-10 19:44:41,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 659 transitions. [2020-02-10 19:44:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:41,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:41,692 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1493760628, now seen corresponding path program 177 times [2020-02-10 19:44:41,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335131509] [2020-02-10 19:44:41,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,904 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:41,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335131509] [2020-02-10 19:44:41,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:41,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259990678] [2020-02-10 19:44:41,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:41,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:41,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:41,905 INFO L87 Difference]: Start difference. First operand 218 states and 659 transitions. Second operand 8 states. [2020-02-10 19:44:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,976 INFO L93 Difference]: Finished difference Result 375 states and 968 transitions. [2020-02-10 19:44:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:41,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,978 INFO L225 Difference]: With dead ends: 375 [2020-02-10 19:44:41,978 INFO L226 Difference]: Without dead ends: 359 [2020-02-10 19:44:41,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-02-10 19:44:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 223. [2020-02-10 19:44:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-02-10 19:44:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 668 transitions. [2020-02-10 19:44:41,983 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 668 transitions. Word has length 19 [2020-02-10 19:44:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,983 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 668 transitions. [2020-02-10 19:44:41,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 668 transitions. [2020-02-10 19:44:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:41,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:41,984 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2050144574, now seen corresponding path program 178 times [2020-02-10 19:44:41,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086147402] [2020-02-10 19:44:41,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,177 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:42,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086147402] [2020-02-10 19:44:42,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:42,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605760789] [2020-02-10 19:44:42,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:42,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:42,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:42,178 INFO L87 Difference]: Start difference. First operand 223 states and 668 transitions. Second operand 8 states. [2020-02-10 19:44:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,262 INFO L93 Difference]: Finished difference Result 371 states and 956 transitions. [2020-02-10 19:44:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:42,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,263 INFO L225 Difference]: With dead ends: 371 [2020-02-10 19:44:42,264 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 19:44:42,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 19:44:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 218. [2020-02-10 19:44:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 19:44:42,269 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 19:44:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,270 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 19:44:42,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 19:44:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:42,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:42,270 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 780024098, now seen corresponding path program 179 times [2020-02-10 19:44:42,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005578316] [2020-02-10 19:44:42,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,477 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:42,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005578316] [2020-02-10 19:44:42,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:42,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540450942] [2020-02-10 19:44:42,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:42,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:42,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:42,478 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 19:44:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,571 INFO L93 Difference]: Finished difference Result 370 states and 955 transitions. [2020-02-10 19:44:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:42,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,573 INFO L225 Difference]: With dead ends: 370 [2020-02-10 19:44:42,573 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 19:44:42,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 19:44:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 222. [2020-02-10 19:44:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 19:44:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 662 transitions. [2020-02-10 19:44:42,579 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 662 transitions. Word has length 19 [2020-02-10 19:44:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,579 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 662 transitions. [2020-02-10 19:44:42,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 662 transitions. [2020-02-10 19:44:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:42,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:42,580 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash 779429452, now seen corresponding path program 180 times [2020-02-10 19:44:42,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879577668] [2020-02-10 19:44:42,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,773 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:42,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879577668] [2020-02-10 19:44:42,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:42,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417570798] [2020-02-10 19:44:42,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:42,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:42,776 INFO L87 Difference]: Start difference. First operand 222 states and 662 transitions. Second operand 8 states. [2020-02-10 19:44:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,863 INFO L93 Difference]: Finished difference Result 368 states and 947 transitions. [2020-02-10 19:44:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:42,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,865 INFO L225 Difference]: With dead ends: 368 [2020-02-10 19:44:42,865 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 19:44:42,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 19:44:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 212. [2020-02-10 19:44:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 640 transitions. [2020-02-10 19:44:42,870 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 640 transitions. Word has length 19 [2020-02-10 19:44:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,870 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 640 transitions. [2020-02-10 19:44:42,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 640 transitions. [2020-02-10 19:44:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:42,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:42,871 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash -637075472, now seen corresponding path program 181 times [2020-02-10 19:44:42,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975892897] [2020-02-10 19:44:42,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,066 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:43,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975892897] [2020-02-10 19:44:43,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:43,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214916245] [2020-02-10 19:44:43,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:43,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:43,069 INFO L87 Difference]: Start difference. First operand 212 states and 640 transitions. Second operand 8 states. [2020-02-10 19:44:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,144 INFO L93 Difference]: Finished difference Result 357 states and 917 transitions. [2020-02-10 19:44:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:43,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,145 INFO L225 Difference]: With dead ends: 357 [2020-02-10 19:44:43,145 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 19:44:43,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 19:44:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 218. [2020-02-10 19:44:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 19:44:43,150 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 19:44:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,150 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 19:44:43,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 19:44:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:43,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:43,151 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash -378017246, now seen corresponding path program 182 times [2020-02-10 19:44:43,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118208347] [2020-02-10 19:44:43,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,368 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:43,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118208347] [2020-02-10 19:44:43,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:43,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308491900] [2020-02-10 19:44:43,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:43,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:43,370 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 19:44:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,437 INFO L93 Difference]: Finished difference Result 351 states and 902 transitions. [2020-02-10 19:44:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:43,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,439 INFO L225 Difference]: With dead ends: 351 [2020-02-10 19:44:43,439 INFO L226 Difference]: Without dead ends: 338 [2020-02-10 19:44:43,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-02-10 19:44:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 215. [2020-02-10 19:44:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 19:44:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 647 transitions. [2020-02-10 19:44:43,444 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 647 transitions. Word has length 19 [2020-02-10 19:44:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,444 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 647 transitions. [2020-02-10 19:44:43,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 647 transitions. [2020-02-10 19:44:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:43,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:43,445 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2057453970, now seen corresponding path program 183 times [2020-02-10 19:44:43,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380160236] [2020-02-10 19:44:43,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,653 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:43,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380160236] [2020-02-10 19:44:43,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:43,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659114116] [2020-02-10 19:44:43,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:43,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:43,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:43,655 INFO L87 Difference]: Start difference. First operand 215 states and 647 transitions. Second operand 8 states. [2020-02-10 19:44:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,726 INFO L93 Difference]: Finished difference Result 356 states and 912 transitions. [2020-02-10 19:44:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:43,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,727 INFO L225 Difference]: With dead ends: 356 [2020-02-10 19:44:43,727 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 19:44:43,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 19:44:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-02-10 19:44:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 19:44:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-02-10 19:44:43,732 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-02-10 19:44:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,732 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-02-10 19:44:43,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-02-10 19:44:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:43,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:43,733 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1306391876, now seen corresponding path program 184 times [2020-02-10 19:44:43,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029620354] [2020-02-10 19:44:43,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,926 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:43,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029620354] [2020-02-10 19:44:43,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:43,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104690384] [2020-02-10 19:44:43,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:43,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:43,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:43,927 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-02-10 19:44:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,024 INFO L93 Difference]: Finished difference Result 352 states and 900 transitions. [2020-02-10 19:44:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:44,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,025 INFO L225 Difference]: With dead ends: 352 [2020-02-10 19:44:44,025 INFO L226 Difference]: Without dead ends: 335 [2020-02-10 19:44:44,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-02-10 19:44:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-02-10 19:44:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 19:44:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2020-02-10 19:44:44,031 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2020-02-10 19:44:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,031 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2020-02-10 19:44:44,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2020-02-10 19:44:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:44,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:44,032 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1837091698, now seen corresponding path program 185 times [2020-02-10 19:44:44,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933443441] [2020-02-10 19:44:44,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:44,238 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:44,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933443441] [2020-02-10 19:44:44,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:44,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710227004] [2020-02-10 19:44:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:44,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:44,240 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand 8 states. [2020-02-10 19:44:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,304 INFO L93 Difference]: Finished difference Result 341 states and 876 transitions. [2020-02-10 19:44:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:44,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,305 INFO L225 Difference]: With dead ends: 341 [2020-02-10 19:44:44,305 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 19:44:44,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 19:44:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 217. [2020-02-10 19:44:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-02-10 19:44:44,311 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-02-10 19:44:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,311 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-02-10 19:44:44,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-02-10 19:44:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:44,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:44,312 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1602568944, now seen corresponding path program 186 times [2020-02-10 19:44:44,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598988761] [2020-02-10 19:44:44,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:44,501 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:44,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598988761] [2020-02-10 19:44:44,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:44,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973429705] [2020-02-10 19:44:44,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:44,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:44,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:44,502 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-02-10 19:44:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,606 INFO L93 Difference]: Finished difference Result 339 states and 871 transitions. [2020-02-10 19:44:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:44,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,607 INFO L225 Difference]: With dead ends: 339 [2020-02-10 19:44:44,608 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 19:44:44,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 19:44:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-02-10 19:44:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 19:44:44,614 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 19:44:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,614 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 19:44:44,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 19:44:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:44,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:44,615 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2036640602, now seen corresponding path program 187 times [2020-02-10 19:44:44,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249118758] [2020-02-10 19:44:44,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:44,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:44:44,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249118758] [2020-02-10 19:44:44,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:44,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655619319] [2020-02-10 19:44:44,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:44,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:44,807 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 19:44:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,895 INFO L93 Difference]: Finished difference Result 347 states and 896 transitions. [2020-02-10 19:44:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:44,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,896 INFO L225 Difference]: With dead ends: 347 [2020-02-10 19:44:44,896 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 19:44:44,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 19:44:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 216. [2020-02-10 19:44:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-02-10 19:44:44,901 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-02-10 19:44:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,902 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-02-10 19:44:44,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-02-10 19:44:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:44,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:44,903 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash -916510772, now seen corresponding path program 188 times [2020-02-10 19:44:44,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311319759] [2020-02-10 19:44:44,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,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:45,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311319759] [2020-02-10 19:44:45,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:45,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797625380] [2020-02-10 19:44:45,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:45,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:45,082 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-02-10 19:44:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,148 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-02-10 19:44:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:45,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,150 INFO L225 Difference]: With dead ends: 343 [2020-02-10 19:44:45,150 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 19:44:45,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 19:44:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-02-10 19:44:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 19:44:45,156 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 19:44:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,156 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 19:44:45,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 19:44:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:45,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:45,157 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1513624196, now seen corresponding path program 189 times [2020-02-10 19:44:45,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422885709] [2020-02-10 19:44:45,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:45,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422885709] [2020-02-10 19:44:45,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:45,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363863671] [2020-02-10 19:44:45,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:45,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:45,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:45,347 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 19:44:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,438 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-02-10 19:44:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:45,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:45,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,440 INFO L225 Difference]: With dead ends: 347 [2020-02-10 19:44:45,440 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 19:44:45,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 19:44:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-02-10 19:44:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 650 transitions. [2020-02-10 19:44:45,447 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 650 transitions. Word has length 19 [2020-02-10 19:44:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,447 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 650 transitions. [2020-02-10 19:44:45,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 650 transitions. [2020-02-10 19:44:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:45,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:45,448 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 768327052, now seen corresponding path program 190 times [2020-02-10 19:44:45,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600933173] [2020-02-10 19:44:45,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,640 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:45,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600933173] [2020-02-10 19:44:45,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:45,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354378401] [2020-02-10 19:44:45,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:45,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:45,642 INFO L87 Difference]: Start difference. First operand 218 states and 650 transitions. Second operand 8 states. [2020-02-10 19:44:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,722 INFO L93 Difference]: Finished difference Result 345 states and 886 transitions. [2020-02-10 19:44:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:45,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,723 INFO L225 Difference]: With dead ends: 345 [2020-02-10 19:44:45,723 INFO L226 Difference]: Without dead ends: 329 [2020-02-10 19:44:45,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-02-10 19:44:45,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 214. [2020-02-10 19:44:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-02-10 19:44:45,729 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-02-10 19:44:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,729 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-02-10 19:44:45,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-02-10 19:44:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:45,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:45,730 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1451740574, now seen corresponding path program 191 times [2020-02-10 19:44:45,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960443211] [2020-02-10 19:44:45,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,931 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:45,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960443211] [2020-02-10 19:44:45,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:45,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20894616] [2020-02-10 19:44:45,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:45,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:45,933 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-02-10 19:44:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,993 INFO L93 Difference]: Finished difference Result 337 states and 867 transitions. [2020-02-10 19:44:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:45,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,994 INFO L225 Difference]: With dead ends: 337 [2020-02-10 19:44:45,995 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 19:44:45,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 19:44:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 216. [2020-02-10 19:44:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-02-10 19:44:46,000 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-02-10 19:44:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,000 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-02-10 19:44:46,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-02-10 19:44:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:46,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:46,001 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:46,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1987920068, now seen corresponding path program 192 times [2020-02-10 19:44:46,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566029268] [2020-02-10 19:44:46,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,180 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:46,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566029268] [2020-02-10 19:44:46,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:46,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728728146] [2020-02-10 19:44:46,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:46,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:46,182 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-02-10 19:44:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,287 INFO L93 Difference]: Finished difference Result 335 states and 862 transitions. [2020-02-10 19:44:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:46,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,288 INFO L225 Difference]: With dead ends: 335 [2020-02-10 19:44:46,289 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 19:44:46,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 19:44:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 208. [2020-02-10 19:44:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 19:44:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 628 transitions. [2020-02-10 19:44:46,293 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 628 transitions. Word has length 19 [2020-02-10 19:44:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,294 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 628 transitions. [2020-02-10 19:44:46,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 628 transitions. [2020-02-10 19:44:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:46,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:46,294 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 807111978, now seen corresponding path program 193 times [2020-02-10 19:44:46,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272422228] [2020-02-10 19:44:46,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,493 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:46,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272422228] [2020-02-10 19:44:46,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:46,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772479786] [2020-02-10 19:44:46,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:46,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:46,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:46,494 INFO L87 Difference]: Start difference. First operand 208 states and 628 transitions. Second operand 8 states. [2020-02-10 19:44:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,588 INFO L93 Difference]: Finished difference Result 357 states and 929 transitions. [2020-02-10 19:44:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:46,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,590 INFO L225 Difference]: With dead ends: 357 [2020-02-10 19:44:46,590 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 19:44:46,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 19:44:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 217. [2020-02-10 19:44:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-02-10 19:44:46,597 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-02-10 19:44:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,597 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-02-10 19:44:46,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-02-10 19:44:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:46,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,598 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:46,598 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1066170204, now seen corresponding path program 194 times [2020-02-10 19:44:46,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560116127] [2020-02-10 19:44:46,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,796 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:46,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560116127] [2020-02-10 19:44:46,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:46,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227543978] [2020-02-10 19:44:46,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:46,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:46,798 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-02-10 19:44:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,863 INFO L93 Difference]: Finished difference Result 351 states and 914 transitions. [2020-02-10 19:44:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:46,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,864 INFO L225 Difference]: With dead ends: 351 [2020-02-10 19:44:46,864 INFO L226 Difference]: Without dead ends: 338 [2020-02-10 19:44:46,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-02-10 19:44:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 214. [2020-02-10 19:44:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 648 transitions. [2020-02-10 19:44:46,870 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 648 transitions. Word has length 19 [2020-02-10 19:44:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,870 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 648 transitions. [2020-02-10 19:44:46,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 648 transitions. [2020-02-10 19:44:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:46,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:46,871 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash -793325876, now seen corresponding path program 195 times [2020-02-10 19:44:46,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047785663] [2020-02-10 19:44:46,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,076 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:47,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047785663] [2020-02-10 19:44:47,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:47,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757595671] [2020-02-10 19:44:47,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:47,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:47,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:47,077 INFO L87 Difference]: Start difference. First operand 214 states and 648 transitions. Second operand 8 states. [2020-02-10 19:44:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,153 INFO L93 Difference]: Finished difference Result 361 states and 938 transitions. [2020-02-10 19:44:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:47,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,154 INFO L225 Difference]: With dead ends: 361 [2020-02-10 19:44:47,154 INFO L226 Difference]: Without dead ends: 345 [2020-02-10 19:44:47,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-02-10 19:44:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 219. [2020-02-10 19:44:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 19:44:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 657 transitions. [2020-02-10 19:44:47,160 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 657 transitions. Word has length 19 [2020-02-10 19:44:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,160 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 657 transitions. [2020-02-10 19:44:47,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 657 transitions. [2020-02-10 19:44:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:47,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:47,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:47,160 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1544387970, now seen corresponding path program 196 times [2020-02-10 19:44:47,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218472736] [2020-02-10 19:44:47,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,372 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:47,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218472736] [2020-02-10 19:44:47,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:47,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919725290] [2020-02-10 19:44:47,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:47,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:47,373 INFO L87 Difference]: Start difference. First operand 219 states and 657 transitions. Second operand 8 states. [2020-02-10 19:44:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,459 INFO L93 Difference]: Finished difference Result 357 states and 926 transitions. [2020-02-10 19:44:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:47,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,461 INFO L225 Difference]: With dead ends: 357 [2020-02-10 19:44:47,461 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 19:44:47,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 19:44:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-02-10 19:44:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-02-10 19:44:47,466 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-02-10 19:44:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,466 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-02-10 19:44:47,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-02-10 19:44:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:47,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:47,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:47,467 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash -392904248, now seen corresponding path program 197 times [2020-02-10 19:44:47,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381748087] [2020-02-10 19:44:47,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,670 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:47,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381748087] [2020-02-10 19:44:47,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:47,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622822632] [2020-02-10 19:44:47,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:47,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:47,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:47,671 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-02-10 19:44:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,742 INFO L93 Difference]: Finished difference Result 346 states and 902 transitions. [2020-02-10 19:44:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:47,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,744 INFO L225 Difference]: With dead ends: 346 [2020-02-10 19:44:47,744 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 19:44:47,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 19:44:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2020-02-10 19:44:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2020-02-10 19:44:47,749 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2020-02-10 19:44:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,750 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2020-02-10 19:44:47,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2020-02-10 19:44:47,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:47,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:47,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:47,750 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1248210902, now seen corresponding path program 198 times [2020-02-10 19:44:47,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062063977] [2020-02-10 19:44:47,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,945 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:47,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062063977] [2020-02-10 19:44:47,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:47,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987846516] [2020-02-10 19:44:47,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:47,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:47,947 INFO L87 Difference]: Start difference. First operand 216 states and 648 transitions. Second operand 8 states. [2020-02-10 19:44:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,038 INFO L93 Difference]: Finished difference Result 348 states and 905 transitions. [2020-02-10 19:44:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:48,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,039 INFO L225 Difference]: With dead ends: 348 [2020-02-10 19:44:48,039 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 19:44:48,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 19:44:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 211. [2020-02-10 19:44:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 19:44:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 638 transitions. [2020-02-10 19:44:48,045 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 638 transitions. Word has length 19 [2020-02-10 19:44:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,045 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 638 transitions. [2020-02-10 19:44:48,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 638 transitions. [2020-02-10 19:44:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:48,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:48,046 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1561821240, now seen corresponding path program 199 times [2020-02-10 19:44:48,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606423459] [2020-02-10 19:44:48,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,245 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:48,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606423459] [2020-02-10 19:44:48,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:48,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614120164] [2020-02-10 19:44:48,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:48,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:48,247 INFO L87 Difference]: Start difference. First operand 211 states and 638 transitions. Second operand 8 states. [2020-02-10 19:44:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,306 INFO L93 Difference]: Finished difference Result 359 states and 931 transitions. [2020-02-10 19:44:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:48,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,308 INFO L225 Difference]: With dead ends: 359 [2020-02-10 19:44:48,308 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 19:44:48,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 19:44:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 217. [2020-02-10 19:44:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 652 transitions. [2020-02-10 19:44:48,313 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 652 transitions. Word has length 19 [2020-02-10 19:44:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,313 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 652 transitions. [2020-02-10 19:44:48,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 652 transitions. [2020-02-10 19:44:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:48,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:48,314 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1302763014, now seen corresponding path program 200 times [2020-02-10 19:44:48,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404270550] [2020-02-10 19:44:48,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,560 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:48,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404270550] [2020-02-10 19:44:48,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:48,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541593404] [2020-02-10 19:44:48,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:48,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:48,563 INFO L87 Difference]: Start difference. First operand 217 states and 652 transitions. Second operand 8 states. [2020-02-10 19:44:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,634 INFO L93 Difference]: Finished difference Result 353 states and 916 transitions. [2020-02-10 19:44:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:48,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,635 INFO L225 Difference]: With dead ends: 353 [2020-02-10 19:44:48,635 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 19:44:48,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 19:44:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-02-10 19:44:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-02-10 19:44:48,641 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-02-10 19:44:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,642 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-02-10 19:44:48,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-02-10 19:44:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:48,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:48,643 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:48,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash -467729652, now seen corresponding path program 201 times [2020-02-10 19:44:48,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426937227] [2020-02-10 19:44:48,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,914 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:48,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426937227] [2020-02-10 19:44:48,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:48,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222389556] [2020-02-10 19:44:48,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:48,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:48,916 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-02-10 19:44:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,984 INFO L93 Difference]: Finished difference Result 365 states and 945 transitions. [2020-02-10 19:44:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:48,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,985 INFO L225 Difference]: With dead ends: 365 [2020-02-10 19:44:48,985 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 19:44:48,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 19:44:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 220. [2020-02-10 19:44:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 19:44:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-02-10 19:44:48,991 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-02-10 19:44:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,991 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-02-10 19:44:48,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-02-10 19:44:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:48,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:48,992 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1443934402, now seen corresponding path program 202 times [2020-02-10 19:44:48,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125865732] [2020-02-10 19:44:48,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,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:44:49,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125865732] [2020-02-10 19:44:49,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:49,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187367627] [2020-02-10 19:44:49,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:49,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:49,190 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-02-10 19:44:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,282 INFO L93 Difference]: Finished difference Result 362 states and 934 transitions. [2020-02-10 19:44:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:49,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,284 INFO L225 Difference]: With dead ends: 362 [2020-02-10 19:44:49,284 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 19:44:49,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 19:44:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 214. [2020-02-10 19:44:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 19:44:49,289 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 19:44:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,289 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 19:44:49,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 19:44:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:49,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:49,290 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1543632934, now seen corresponding path program 203 times [2020-02-10 19:44:49,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047004177] [2020-02-10 19:44:49,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,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:44:49,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047004177] [2020-02-10 19:44:49,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:49,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289576219] [2020-02-10 19:44:49,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:49,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:49,493 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 19:44:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,563 INFO L93 Difference]: Finished difference Result 349 states and 906 transitions. [2020-02-10 19:44:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:49,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,565 INFO L225 Difference]: With dead ends: 349 [2020-02-10 19:44:49,565 INFO L226 Difference]: Without dead ends: 339 [2020-02-10 19:44:49,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-02-10 19:44:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 216. [2020-02-10 19:44:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 645 transitions. [2020-02-10 19:44:49,570 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 645 transitions. Word has length 19 [2020-02-10 19:44:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,571 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 645 transitions. [2020-02-10 19:44:49,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 645 transitions. [2020-02-10 19:44:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:49,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:49,571 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1261929366, now seen corresponding path program 204 times [2020-02-10 19:44:49,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470167744] [2020-02-10 19:44:49,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,770 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:49,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470167744] [2020-02-10 19:44:49,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:49,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592535717] [2020-02-10 19:44:49,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:49,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:49,771 INFO L87 Difference]: Start difference. First operand 216 states and 645 transitions. Second operand 8 states. [2020-02-10 19:44:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,852 INFO L93 Difference]: Finished difference Result 352 states and 911 transitions. [2020-02-10 19:44:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:49,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,854 INFO L225 Difference]: With dead ends: 352 [2020-02-10 19:44:49,854 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 19:44:49,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 19:44:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 211. [2020-02-10 19:44:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 19:44:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 635 transitions. [2020-02-10 19:44:49,859 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 635 transitions. Word has length 19 [2020-02-10 19:44:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,859 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 635 transitions. [2020-02-10 19:44:49,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 635 transitions. [2020-02-10 19:44:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:49,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:49,860 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1236225016, now seen corresponding path program 205 times [2020-02-10 19:44:49,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156360374] [2020-02-10 19:44:49,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,064 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:50,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156360374] [2020-02-10 19:44:50,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:50,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239641909] [2020-02-10 19:44:50,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:50,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:50,065 INFO L87 Difference]: Start difference. First operand 211 states and 635 transitions. Second operand 8 states. [2020-02-10 19:44:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,121 INFO L93 Difference]: Finished difference Result 366 states and 949 transitions. [2020-02-10 19:44:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:50,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,123 INFO L225 Difference]: With dead ends: 366 [2020-02-10 19:44:50,123 INFO L226 Difference]: Without dead ends: 350 [2020-02-10 19:44:50,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-02-10 19:44:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 221. [2020-02-10 19:44:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-02-10 19:44:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2020-02-10 19:44:50,129 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 19 [2020-02-10 19:44:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,129 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2020-02-10 19:44:50,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2020-02-10 19:44:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:50,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:50,130 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1987287110, now seen corresponding path program 206 times [2020-02-10 19:44:50,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469752283] [2020-02-10 19:44:50,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,322 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:50,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469752283] [2020-02-10 19:44:50,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:50,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684874536] [2020-02-10 19:44:50,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:50,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:50,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:50,323 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand 8 states. [2020-02-10 19:44:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,402 INFO L93 Difference]: Finished difference Result 362 states and 937 transitions. [2020-02-10 19:44:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:50,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,404 INFO L225 Difference]: With dead ends: 362 [2020-02-10 19:44:50,404 INFO L226 Difference]: Without dead ends: 345 [2020-02-10 19:44:50,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-02-10 19:44:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 216. [2020-02-10 19:44:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 649 transitions. [2020-02-10 19:44:50,409 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 649 transitions. Word has length 19 [2020-02-10 19:44:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,409 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 649 transitions. [2020-02-10 19:44:50,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 649 transitions. [2020-02-10 19:44:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:50,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:50,410 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1458304426, now seen corresponding path program 207 times [2020-02-10 19:44:50,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929904613] [2020-02-10 19:44:50,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,611 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:50,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929904613] [2020-02-10 19:44:50,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:50,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954041101] [2020-02-10 19:44:50,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:50,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:50,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:50,613 INFO L87 Difference]: Start difference. First operand 216 states and 649 transitions. Second operand 8 states. [2020-02-10 19:44:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,681 INFO L93 Difference]: Finished difference Result 368 states and 949 transitions. [2020-02-10 19:44:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:50,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,683 INFO L225 Difference]: With dead ends: 368 [2020-02-10 19:44:50,683 INFO L226 Difference]: Without dead ends: 352 [2020-02-10 19:44:50,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-02-10 19:44:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 222. [2020-02-10 19:44:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-02-10 19:44:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 660 transitions. [2020-02-10 19:44:50,688 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 660 transitions. Word has length 19 [2020-02-10 19:44:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,688 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 660 transitions. [2020-02-10 19:44:50,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 660 transitions. [2020-02-10 19:44:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:50,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:50,689 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 482099676, now seen corresponding path program 208 times [2020-02-10 19:44:50,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601731653] [2020-02-10 19:44:50,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,880 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:50,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601731653] [2020-02-10 19:44:50,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:50,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195450916] [2020-02-10 19:44:50,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:50,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:50,882 INFO L87 Difference]: Start difference. First operand 222 states and 660 transitions. Second operand 8 states. [2020-02-10 19:44:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,964 INFO L93 Difference]: Finished difference Result 365 states and 938 transitions. [2020-02-10 19:44:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:50,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,965 INFO L225 Difference]: With dead ends: 365 [2020-02-10 19:44:50,965 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 19:44:50,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 19:44:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 216. [2020-02-10 19:44:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 644 transitions. [2020-02-10 19:44:50,971 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 644 transitions. Word has length 19 [2020-02-10 19:44:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,971 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 644 transitions. [2020-02-10 19:44:50,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 644 transitions. [2020-02-10 19:44:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:50,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:50,972 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2110104008, now seen corresponding path program 209 times [2020-02-10 19:44:50,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654911205] [2020-02-10 19:44:50,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,169 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:51,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654911205] [2020-02-10 19:44:51,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:51,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739837721] [2020-02-10 19:44:51,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:51,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:51,171 INFO L87 Difference]: Start difference. First operand 216 states and 644 transitions. Second operand 8 states. [2020-02-10 19:44:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:51,249 INFO L93 Difference]: Finished difference Result 358 states and 925 transitions. [2020-02-10 19:44:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:51,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:51,251 INFO L225 Difference]: With dead ends: 358 [2020-02-10 19:44:51,251 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 19:44:51,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 19:44:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 220. [2020-02-10 19:44:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-02-10 19:44:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 652 transitions. [2020-02-10 19:44:51,256 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 652 transitions. Word has length 19 [2020-02-10 19:44:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:51,256 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 652 transitions. [2020-02-10 19:44:51,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 652 transitions. [2020-02-10 19:44:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:51,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:51,257 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:51,257 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1325988758, now seen corresponding path program 210 times [2020-02-10 19:44:51,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:51,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977272756] [2020-02-10 19:44:51,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,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:51,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977272756] [2020-02-10 19:44:51,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:51,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259482307] [2020-02-10 19:44:51,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:51,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:51,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:51,451 INFO L87 Difference]: Start difference. First operand 220 states and 652 transitions. Second operand 8 states. [2020-02-10 19:44:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:51,535 INFO L93 Difference]: Finished difference Result 359 states and 923 transitions. [2020-02-10 19:44:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:51,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:51,536 INFO L225 Difference]: With dead ends: 359 [2020-02-10 19:44:51,536 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 19:44:51,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 19:44:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2020-02-10 19:44:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 19:44:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 632 transitions. [2020-02-10 19:44:51,542 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 632 transitions. Word has length 19 [2020-02-10 19:44:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:51,542 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 632 transitions. [2020-02-10 19:44:51,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 632 transitions. [2020-02-10 19:44:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:51,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:51,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:51,542 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:51,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1946024220, now seen corresponding path program 211 times [2020-02-10 19:44:51,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:51,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491878173] [2020-02-10 19:44:51,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,738 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:51,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491878173] [2020-02-10 19:44:51,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:51,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687519388] [2020-02-10 19:44:51,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:51,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:51,740 INFO L87 Difference]: Start difference. First operand 211 states and 632 transitions. Second operand 8 states. [2020-02-10 19:44:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:51,801 INFO L93 Difference]: Finished difference Result 335 states and 868 transitions. [2020-02-10 19:44:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:51,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:51,803 INFO L225 Difference]: With dead ends: 335 [2020-02-10 19:44:51,803 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 19:44:51,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 19:44:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2020-02-10 19:44:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 19:44:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 642 transitions. [2020-02-10 19:44:51,813 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 642 transitions. Word has length 19 [2020-02-10 19:44:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:51,813 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 642 transitions. [2020-02-10 19:44:51,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 642 transitions. [2020-02-10 19:44:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:51,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:51,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:51,814 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1090717566, now seen corresponding path program 212 times [2020-02-10 19:44:51,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:51,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79781887] [2020-02-10 19:44:51,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,003 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:52,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79781887] [2020-02-10 19:44:52,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:52,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060414650] [2020-02-10 19:44:52,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:52,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:52,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:52,004 INFO L87 Difference]: Start difference. First operand 215 states and 642 transitions. Second operand 8 states. [2020-02-10 19:44:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,094 INFO L93 Difference]: Finished difference Result 337 states and 871 transitions. [2020-02-10 19:44:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:52,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,095 INFO L225 Difference]: With dead ends: 337 [2020-02-10 19:44:52,095 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 19:44:52,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 19:44:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 213. [2020-02-10 19:44:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 19:44:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 637 transitions. [2020-02-10 19:44:52,101 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 637 transitions. Word has length 19 [2020-02-10 19:44:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,101 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 637 transitions. [2020-02-10 19:44:52,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 637 transitions. [2020-02-10 19:44:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:52,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:52,102 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 213 times [2020-02-10 19:44:52,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020106340] [2020-02-10 19:44:52,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:52,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020106340] [2020-02-10 19:44:52,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:52,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492364766] [2020-02-10 19:44:52,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:52,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:52,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:52,297 INFO L87 Difference]: Start difference. First operand 213 states and 637 transitions. Second operand 8 states. [2020-02-10 19:44:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,391 INFO L93 Difference]: Finished difference Result 336 states and 868 transitions. [2020-02-10 19:44:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:52,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,392 INFO L225 Difference]: With dead ends: 336 [2020-02-10 19:44:52,392 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 19:44:52,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 19:44:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 215. [2020-02-10 19:44:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 19:44:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 640 transitions. [2020-02-10 19:44:52,397 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 640 transitions. Word has length 19 [2020-02-10 19:44:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,398 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 640 transitions. [2020-02-10 19:44:52,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 640 transitions. [2020-02-10 19:44:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:52,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:52,399 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,399 INFO L82 PathProgramCache]: Analyzing trace with hash 751402878, now seen corresponding path program 214 times [2020-02-10 19:44:52,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732079603] [2020-02-10 19:44:52,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,594 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:52,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732079603] [2020-02-10 19:44:52,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:52,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562105710] [2020-02-10 19:44:52,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:52,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:52,596 INFO L87 Difference]: Start difference. First operand 215 states and 640 transitions. Second operand 8 states. [2020-02-10 19:44:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,680 INFO L93 Difference]: Finished difference Result 339 states and 873 transitions. [2020-02-10 19:44:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:52,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,681 INFO L225 Difference]: With dead ends: 339 [2020-02-10 19:44:52,681 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 19:44:52,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 19:44:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 213. [2020-02-10 19:44:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-02-10 19:44:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 635 transitions. [2020-02-10 19:44:52,687 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 635 transitions. Word has length 19 [2020-02-10 19:44:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,687 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 635 transitions. [2020-02-10 19:44:52,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 635 transitions. [2020-02-10 19:44:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:52,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:52,688 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash 17632186, now seen corresponding path program 215 times [2020-02-10 19:44:52,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905179054] [2020-02-10 19:44:52,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,881 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:52,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905179054] [2020-02-10 19:44:52,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:52,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122061237] [2020-02-10 19:44:52,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:52,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:52,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:52,883 INFO L87 Difference]: Start difference. First operand 213 states and 635 transitions. Second operand 8 states. [2020-02-10 19:44:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,969 INFO L93 Difference]: Finished difference Result 338 states and 871 transitions. [2020-02-10 19:44:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:52,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,971 INFO L225 Difference]: With dead ends: 338 [2020-02-10 19:44:52,971 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 19:44:52,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 19:44:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 217. [2020-02-10 19:44:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 643 transitions. [2020-02-10 19:44:52,977 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 643 transitions. Word has length 19 [2020-02-10 19:44:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,977 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 643 transitions. [2020-02-10 19:44:52,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 643 transitions. [2020-02-10 19:44:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:52,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:52,978 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 216 times [2020-02-10 19:44:52,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976387649] [2020-02-10 19:44:52,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,186 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:53,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976387649] [2020-02-10 19:44:53,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:53,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095087205] [2020-02-10 19:44:53,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:53,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:53,187 INFO L87 Difference]: Start difference. First operand 217 states and 643 transitions. Second operand 8 states. [2020-02-10 19:44:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,268 INFO L93 Difference]: Finished difference Result 339 states and 869 transitions. [2020-02-10 19:44:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:53,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,269 INFO L225 Difference]: With dead ends: 339 [2020-02-10 19:44:53,269 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 19:44:53,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 19:44:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 208. [2020-02-10 19:44:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 19:44:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 625 transitions. [2020-02-10 19:44:53,275 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 625 transitions. Word has length 19 [2020-02-10 19:44:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,275 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 625 transitions. [2020-02-10 19:44:53,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 625 transitions. [2020-02-10 19:44:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:53,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:53,276 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1434799680, now seen corresponding path program 217 times [2020-02-10 19:44:53,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791299171] [2020-02-10 19:44:53,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,451 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:53,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791299171] [2020-02-10 19:44:53,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:53,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405655432] [2020-02-10 19:44:53,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:53,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:53,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:53,452 INFO L87 Difference]: Start difference. First operand 208 states and 625 transitions. Second operand 8 states. [2020-02-10 19:44:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,526 INFO L93 Difference]: Finished difference Result 338 states and 886 transitions. [2020-02-10 19:44:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:53,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,527 INFO L225 Difference]: With dead ends: 338 [2020-02-10 19:44:53,527 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 19:44:53,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 19:44:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 214. [2020-02-10 19:44:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 644 transitions. [2020-02-10 19:44:53,533 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 644 transitions. Word has length 19 [2020-02-10 19:44:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,533 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 644 transitions. [2020-02-10 19:44:53,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 644 transitions. [2020-02-10 19:44:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:53,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:53,534 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:53,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1740037786, now seen corresponding path program 218 times [2020-02-10 19:44:53,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407157154] [2020-02-10 19:44:53,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,715 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:53,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407157154] [2020-02-10 19:44:53,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:53,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466508073] [2020-02-10 19:44:53,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:53,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:53,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:53,716 INFO L87 Difference]: Start difference. First operand 214 states and 644 transitions. Second operand 8 states. [2020-02-10 19:44:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,775 INFO L93 Difference]: Finished difference Result 334 states and 875 transitions. [2020-02-10 19:44:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:53,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,776 INFO L225 Difference]: With dead ends: 334 [2020-02-10 19:44:53,776 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 19:44:53,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 19:44:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-02-10 19:44:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 639 transitions. [2020-02-10 19:44:53,782 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 639 transitions. Word has length 19 [2020-02-10 19:44:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,782 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 639 transitions. [2020-02-10 19:44:53,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 639 transitions. [2020-02-10 19:44:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:53,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:53,783 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash 690097182, now seen corresponding path program 219 times [2020-02-10 19:44:53,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442045945] [2020-02-10 19:44:53,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,991 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:53,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442045945] [2020-02-10 19:44:53,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:53,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139974138] [2020-02-10 19:44:53,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:53,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:53,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:53,993 INFO L87 Difference]: Start difference. First operand 212 states and 639 transitions. Second operand 8 states. [2020-02-10 19:44:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,069 INFO L93 Difference]: Finished difference Result 342 states and 896 transitions. [2020-02-10 19:44:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:54,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,070 INFO L225 Difference]: With dead ends: 342 [2020-02-10 19:44:54,070 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 19:44:54,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 19:44:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 216. [2020-02-10 19:44:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-02-10 19:44:54,075 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-02-10 19:44:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,075 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-02-10 19:44:54,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-02-10 19:44:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:54,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:54,076 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash -55199962, now seen corresponding path program 220 times [2020-02-10 19:44:54,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111853258] [2020-02-10 19:44:54,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,250 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:54,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111853258] [2020-02-10 19:44:54,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:54,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021399840] [2020-02-10 19:44:54,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:54,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:54,251 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-02-10 19:44:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,331 INFO L93 Difference]: Finished difference Result 340 states and 888 transitions. [2020-02-10 19:44:54,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:54,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,333 INFO L225 Difference]: With dead ends: 340 [2020-02-10 19:44:54,333 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 19:44:54,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 19:44:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-02-10 19:44:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 19:44:54,344 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 19:44:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,344 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 19:44:54,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 19:44:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:54,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:54,344 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:54,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699708, now seen corresponding path program 221 times [2020-02-10 19:44:54,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935204060] [2020-02-10 19:44:54,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:54,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935204060] [2020-02-10 19:44:54,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:54,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236425954] [2020-02-10 19:44:54,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:54,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:54,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:54,538 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 19:44:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,598 INFO L93 Difference]: Finished difference Result 332 states and 869 transitions. [2020-02-10 19:44:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:54,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,599 INFO L225 Difference]: With dead ends: 332 [2020-02-10 19:44:54,599 INFO L226 Difference]: Without dead ends: 322 [2020-02-10 19:44:54,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-02-10 19:44:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2020-02-10 19:44:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-02-10 19:44:54,604 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-02-10 19:44:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,604 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-02-10 19:44:54,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-02-10 19:44:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:54,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:54,605 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1164393054, now seen corresponding path program 222 times [2020-02-10 19:44:54,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720235521] [2020-02-10 19:44:54,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,785 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:54,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720235521] [2020-02-10 19:44:54,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:54,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564263473] [2020-02-10 19:44:54,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:54,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:54,787 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-02-10 19:44:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,860 INFO L93 Difference]: Finished difference Result 334 states and 872 transitions. [2020-02-10 19:44:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:54,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,861 INFO L225 Difference]: With dead ends: 334 [2020-02-10 19:44:54,862 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 19:44:54,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 19:44:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 210. [2020-02-10 19:44:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 19:44:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-02-10 19:44:54,867 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-02-10 19:44:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,867 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-02-10 19:44:54,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-02-10 19:44:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:54,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:54,868 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 223 times [2020-02-10 19:44:54,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756250766] [2020-02-10 19:44:54,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,049 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:55,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756250766] [2020-02-10 19:44:55,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:55,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801878206] [2020-02-10 19:44:55,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:55,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:55,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:55,051 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-02-10 19:44:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,126 INFO L93 Difference]: Finished difference Result 340 states and 889 transitions. [2020-02-10 19:44:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:55,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,128 INFO L225 Difference]: With dead ends: 340 [2020-02-10 19:44:55,128 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 19:44:55,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 19:44:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 214. [2020-02-10 19:44:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 19:44:55,133 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 19:44:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,133 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 19:44:55,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 19:44:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:55,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:55,134 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash 954491656, now seen corresponding path program 224 times [2020-02-10 19:44:55,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351742190] [2020-02-10 19:44:55,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,328 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:55,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351742190] [2020-02-10 19:44:55,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:55,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902147093] [2020-02-10 19:44:55,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:55,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:55,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:55,330 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 19:44:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,394 INFO L93 Difference]: Finished difference Result 336 states and 878 transitions. [2020-02-10 19:44:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:55,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,395 INFO L225 Difference]: With dead ends: 336 [2020-02-10 19:44:55,395 INFO L226 Difference]: Without dead ends: 324 [2020-02-10 19:44:55,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-02-10 19:44:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-02-10 19:44:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-02-10 19:44:55,401 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-02-10 19:44:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,401 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-02-10 19:44:55,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-02-10 19:44:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:55,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,402 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:55,402 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1238723554, now seen corresponding path program 225 times [2020-02-10 19:44:55,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620848627] [2020-02-10 19:44:55,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,592 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:55,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620848627] [2020-02-10 19:44:55,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:55,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744338096] [2020-02-10 19:44:55,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:55,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:55,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:55,593 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-02-10 19:44:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,674 INFO L93 Difference]: Finished difference Result 346 states and 904 transitions. [2020-02-10 19:44:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:55,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,675 INFO L225 Difference]: With dead ends: 346 [2020-02-10 19:44:55,675 INFO L226 Difference]: Without dead ends: 332 [2020-02-10 19:44:55,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-02-10 19:44:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 217. [2020-02-10 19:44:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-02-10 19:44:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-02-10 19:44:55,681 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-02-10 19:44:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,681 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-02-10 19:44:55,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-02-10 19:44:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:55,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:55,682 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1880780472, now seen corresponding path program 226 times [2020-02-10 19:44:55,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693436207] [2020-02-10 19:44:55,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,873 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:55,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693436207] [2020-02-10 19:44:55,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:55,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139742644] [2020-02-10 19:44:55,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:55,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:55,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:55,875 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-02-10 19:44:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,961 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-02-10 19:44:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:55,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,962 INFO L225 Difference]: With dead ends: 345 [2020-02-10 19:44:55,962 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 19:44:55,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 19:44:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 212. [2020-02-10 19:44:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 635 transitions. [2020-02-10 19:44:55,968 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 635 transitions. Word has length 19 [2020-02-10 19:44:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,968 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 635 transitions. [2020-02-10 19:44:55,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 635 transitions. [2020-02-10 19:44:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:55,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:55,969 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2030202812, now seen corresponding path program 227 times [2020-02-10 19:44:55,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486437728] [2020-02-10 19:44:55,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,179 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:56,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486437728] [2020-02-10 19:44:56,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:56,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891066811] [2020-02-10 19:44:56,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:56,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:56,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:56,180 INFO L87 Difference]: Start difference. First operand 212 states and 635 transitions. Second operand 8 states. [2020-02-10 19:44:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,236 INFO L93 Difference]: Finished difference Result 335 states and 874 transitions. [2020-02-10 19:44:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:56,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,238 INFO L225 Difference]: With dead ends: 335 [2020-02-10 19:44:56,238 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 19:44:56,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 19:44:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 214. [2020-02-10 19:44:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 19:44:56,243 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 19:44:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,243 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 19:44:56,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 19:44:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:56,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:56,244 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,244 INFO L82 PathProgramCache]: Analyzing trace with hash -775359488, now seen corresponding path program 228 times [2020-02-10 19:44:56,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042135211] [2020-02-10 19:44:56,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,427 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:56,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042135211] [2020-02-10 19:44:56,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306933388] [2020-02-10 19:44:56,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:56,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:56,428 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 19:44:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,511 INFO L93 Difference]: Finished difference Result 338 states and 879 transitions. [2020-02-10 19:44:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:56,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,512 INFO L225 Difference]: With dead ends: 338 [2020-02-10 19:44:56,512 INFO L226 Difference]: Without dead ends: 321 [2020-02-10 19:44:56,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-02-10 19:44:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 210. [2020-02-10 19:44:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 19:44:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 630 transitions. [2020-02-10 19:44:56,518 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 630 transitions. Word has length 19 [2020-02-10 19:44:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,518 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 630 transitions. [2020-02-10 19:44:56,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 630 transitions. [2020-02-10 19:44:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:56,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,519 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:56,519 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1784188770, now seen corresponding path program 229 times [2020-02-10 19:44:56,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662935660] [2020-02-10 19:44:56,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,712 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:56,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662935660] [2020-02-10 19:44:56,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:56,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607855636] [2020-02-10 19:44:56,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:56,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:56,714 INFO L87 Difference]: Start difference. First operand 210 states and 630 transitions. Second operand 8 states. [2020-02-10 19:44:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,792 INFO L93 Difference]: Finished difference Result 348 states and 911 transitions. [2020-02-10 19:44:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:56,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,793 INFO L225 Difference]: With dead ends: 348 [2020-02-10 19:44:56,793 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 19:44:56,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 19:44:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 218. [2020-02-10 19:44:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-02-10 19:44:56,800 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-02-10 19:44:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,800 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-02-10 19:44:56,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-02-10 19:44:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:56,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:56,801 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1038891626, now seen corresponding path program 230 times [2020-02-10 19:44:56,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612005188] [2020-02-10 19:44:56,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,003 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:57,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612005188] [2020-02-10 19:44:57,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:57,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750804467] [2020-02-10 19:44:57,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:57,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:57,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:57,005 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-02-10 19:44:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,078 INFO L93 Difference]: Finished difference Result 346 states and 903 transitions. [2020-02-10 19:44:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:57,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,079 INFO L225 Difference]: With dead ends: 346 [2020-02-10 19:44:57,079 INFO L226 Difference]: Without dead ends: 330 [2020-02-10 19:44:57,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-02-10 19:44:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 214. [2020-02-10 19:44:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-02-10 19:44:57,084 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-02-10 19:44:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,084 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-02-10 19:44:57,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-02-10 19:44:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:57,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:57,085 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 231 times [2020-02-10 19:44:57,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885830755] [2020-02-10 19:44:57,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,280 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:57,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885830755] [2020-02-10 19:44:57,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:57,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994324078] [2020-02-10 19:44:57,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:57,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:57,282 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-02-10 19:44:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,356 INFO L93 Difference]: Finished difference Result 350 states and 912 transitions. [2020-02-10 19:44:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:57,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,357 INFO L225 Difference]: With dead ends: 350 [2020-02-10 19:44:57,357 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 19:44:57,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 19:44:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 219. [2020-02-10 19:44:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-02-10 19:44:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 652 transitions. [2020-02-10 19:44:57,363 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 652 transitions. Word has length 19 [2020-02-10 19:44:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,363 INFO L479 AbstractCegarLoop]: Abstraction has 219 states and 652 transitions. [2020-02-10 19:44:57,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 652 transitions. [2020-02-10 19:44:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:57,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:57,364 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash 803245866, now seen corresponding path program 232 times [2020-02-10 19:44:57,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981574326] [2020-02-10 19:44:57,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,554 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:57,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981574326] [2020-02-10 19:44:57,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:57,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202982383] [2020-02-10 19:44:57,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:57,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:57,556 INFO L87 Difference]: Start difference. First operand 219 states and 652 transitions. Second operand 8 states. [2020-02-10 19:44:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,639 INFO L93 Difference]: Finished difference Result 349 states and 905 transitions. [2020-02-10 19:44:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:57,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,641 INFO L225 Difference]: With dead ends: 349 [2020-02-10 19:44:57,641 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 19:44:57,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 19:44:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-02-10 19:44:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 19:44:57,646 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 19:44:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,646 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 19:44:57,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 19:44:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:57,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:57,646 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1685003648, now seen corresponding path program 233 times [2020-02-10 19:44:57,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804457141] [2020-02-10 19:44:57,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,839 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:57,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804457141] [2020-02-10 19:44:57,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:57,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11874393] [2020-02-10 19:44:57,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:57,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:57,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:57,841 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 19:44:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,915 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-02-10 19:44:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:57,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,916 INFO L225 Difference]: With dead ends: 345 [2020-02-10 19:44:57,916 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 19:44:57,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 19:44:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-02-10 19:44:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:44:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 646 transitions. [2020-02-10 19:44:57,922 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 646 transitions. Word has length 19 [2020-02-10 19:44:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,922 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 646 transitions. [2020-02-10 19:44:57,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 646 transitions. [2020-02-10 19:44:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:57,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:57,923 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,923 INFO L82 PathProgramCache]: Analyzing trace with hash -826129118, now seen corresponding path program 234 times [2020-02-10 19:44:57,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038981557] [2020-02-10 19:44:57,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,114 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:58,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038981557] [2020-02-10 19:44:58,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:58,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192016665] [2020-02-10 19:44:58,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:58,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:58,116 INFO L87 Difference]: Start difference. First operand 218 states and 646 transitions. Second operand 8 states. [2020-02-10 19:44:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,195 INFO L93 Difference]: Finished difference Result 346 states and 895 transitions. [2020-02-10 19:44:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:58,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,196 INFO L225 Difference]: With dead ends: 346 [2020-02-10 19:44:58,196 INFO L226 Difference]: Without dead ends: 325 [2020-02-10 19:44:58,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-02-10 19:44:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2020-02-10 19:44:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 19:44:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 628 transitions. [2020-02-10 19:44:58,202 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 628 transitions. Word has length 19 [2020-02-10 19:44:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,202 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 628 transitions. [2020-02-10 19:44:58,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 628 transitions. [2020-02-10 19:44:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:58,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:58,202 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1007007176, now seen corresponding path program 235 times [2020-02-10 19:44:58,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816671315] [2020-02-10 19:44:58,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,401 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:58,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816671315] [2020-02-10 19:44:58,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:58,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315308989] [2020-02-10 19:44:58,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:58,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:58,403 INFO L87 Difference]: Start difference. First operand 210 states and 628 transitions. Second operand 8 states. [2020-02-10 19:44:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,459 INFO L93 Difference]: Finished difference Result 327 states and 849 transitions. [2020-02-10 19:44:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:58,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,460 INFO L225 Difference]: With dead ends: 327 [2020-02-10 19:44:58,460 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 19:44:58,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 19:44:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2020-02-10 19:44:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-02-10 19:44:58,465 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-02-10 19:44:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,466 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-02-10 19:44:58,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-02-10 19:44:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:58,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:58,466 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,466 INFO L82 PathProgramCache]: Analyzing trace with hash 151700522, now seen corresponding path program 236 times [2020-02-10 19:44:58,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833521473] [2020-02-10 19:44:58,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:58,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833521473] [2020-02-10 19:44:58,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:58,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811730905] [2020-02-10 19:44:58,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:58,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:58,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:58,659 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-02-10 19:44:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,739 INFO L93 Difference]: Finished difference Result 329 states and 852 transitions. [2020-02-10 19:44:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:58,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,741 INFO L225 Difference]: With dead ends: 329 [2020-02-10 19:44:58,741 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 19:44:58,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 19:44:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 212. [2020-02-10 19:44:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 633 transitions. [2020-02-10 19:44:58,747 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 633 transitions. Word has length 19 [2020-02-10 19:44:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,747 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 633 transitions. [2020-02-10 19:44:58,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 633 transitions. [2020-02-10 19:44:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:58,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:58,747 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 237 times [2020-02-10 19:44:58,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520561097] [2020-02-10 19:44:58,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:58,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520561097] [2020-02-10 19:44:58,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:58,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587817431] [2020-02-10 19:44:58,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:58,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:58,946 INFO L87 Difference]: Start difference. First operand 212 states and 633 transitions. Second operand 8 states. [2020-02-10 19:44:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,002 INFO L93 Difference]: Finished difference Result 328 states and 849 transitions. [2020-02-10 19:44:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:59,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,004 INFO L225 Difference]: With dead ends: 328 [2020-02-10 19:44:59,004 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 19:44:59,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 19:44:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 214. [2020-02-10 19:44:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:44:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 636 transitions. [2020-02-10 19:44:59,010 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 636 transitions. Word has length 19 [2020-02-10 19:44:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,010 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 636 transitions. [2020-02-10 19:44:59,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 636 transitions. [2020-02-10 19:44:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:59,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,011 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,011 INFO L82 PathProgramCache]: Analyzing trace with hash -187614166, now seen corresponding path program 238 times [2020-02-10 19:44:59,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650390903] [2020-02-10 19:44:59,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,198 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:59,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650390903] [2020-02-10 19:44:59,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:59,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327819591] [2020-02-10 19:44:59,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:59,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:59,199 INFO L87 Difference]: Start difference. First operand 214 states and 636 transitions. Second operand 8 states. [2020-02-10 19:44:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,281 INFO L93 Difference]: Finished difference Result 331 states and 854 transitions. [2020-02-10 19:44:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:59,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,282 INFO L225 Difference]: With dead ends: 331 [2020-02-10 19:44:59,282 INFO L226 Difference]: Without dead ends: 316 [2020-02-10 19:44:59,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-02-10 19:44:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 212. [2020-02-10 19:44:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-02-10 19:44:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 631 transitions. [2020-02-10 19:44:59,287 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 631 transitions. Word has length 19 [2020-02-10 19:44:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,287 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 631 transitions. [2020-02-10 19:44:59,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 631 transitions. [2020-02-10 19:44:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:59,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,288 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,288 INFO L82 PathProgramCache]: Analyzing trace with hash -921384858, now seen corresponding path program 239 times [2020-02-10 19:44:59,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087185031] [2020-02-10 19:44:59,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:59,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087185031] [2020-02-10 19:44:59,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:59,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538420897] [2020-02-10 19:44:59,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:59,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:59,490 INFO L87 Difference]: Start difference. First operand 212 states and 631 transitions. Second operand 8 states. [2020-02-10 19:44:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,562 INFO L93 Difference]: Finished difference Result 330 states and 852 transitions. [2020-02-10 19:44:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:59,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,563 INFO L225 Difference]: With dead ends: 330 [2020-02-10 19:44:59,563 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 19:44:59,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 19:44:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 216. [2020-02-10 19:44:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:44:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 639 transitions. [2020-02-10 19:44:59,569 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 639 transitions. Word has length 19 [2020-02-10 19:44:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,569 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 639 transitions. [2020-02-10 19:44:59,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 639 transitions. [2020-02-10 19:44:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:59,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,570 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 240 times [2020-02-10 19:44:59,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399384737] [2020-02-10 19:44:59,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:59,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399384737] [2020-02-10 19:44:59,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:44:59,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267600280] [2020-02-10 19:44:59,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:44:59,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:44:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:44:59,766 INFO L87 Difference]: Start difference. First operand 216 states and 639 transitions. Second operand 8 states. [2020-02-10 19:44:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,844 INFO L93 Difference]: Finished difference Result 331 states and 850 transitions. [2020-02-10 19:44:59,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:44:59,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:44:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,846 INFO L225 Difference]: With dead ends: 331 [2020-02-10 19:44:59,846 INFO L226 Difference]: Without dead ends: 304 [2020-02-10 19:44:59,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:44:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-02-10 19:44:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 202. [2020-02-10 19:44:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 19:44:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 613 transitions. [2020-02-10 19:44:59,851 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 613 transitions. Word has length 19 [2020-02-10 19:44:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,852 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 613 transitions. [2020-02-10 19:44:59,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:44:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 613 transitions. [2020-02-10 19:44:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:44:59,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,852 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1614896374, now seen corresponding path program 241 times [2020-02-10 19:44:59,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853771471] [2020-02-10 19:44:59,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:00,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853771471] [2020-02-10 19:45:00,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:00,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57649904] [2020-02-10 19:45:00,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:00,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:00,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:00,058 INFO L87 Difference]: Start difference. First operand 202 states and 613 transitions. Second operand 8 states. [2020-02-10 19:45:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,118 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-02-10 19:45:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:00,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,120 INFO L225 Difference]: With dead ends: 378 [2020-02-10 19:45:00,120 INFO L226 Difference]: Without dead ends: 362 [2020-02-10 19:45:00,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-02-10 19:45:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 218. [2020-02-10 19:45:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-02-10 19:45:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-02-10 19:45:00,127 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-02-10 19:45:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,127 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-02-10 19:45:00,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-02-10 19:45:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:00,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:00,128 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1989547560, now seen corresponding path program 242 times [2020-02-10 19:45:00,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922306003] [2020-02-10 19:45:00,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,352 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:45:00,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922306003] [2020-02-10 19:45:00,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:00,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462430292] [2020-02-10 19:45:00,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:00,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:00,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:00,353 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-02-10 19:45:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,430 INFO L93 Difference]: Finished difference Result 376 states and 965 transitions. [2020-02-10 19:45:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:00,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,431 INFO L225 Difference]: With dead ends: 376 [2020-02-10 19:45:00,431 INFO L226 Difference]: Without dead ends: 354 [2020-02-10 19:45:00,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-02-10 19:45:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 210. [2020-02-10 19:45:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 19:45:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-02-10 19:45:00,436 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-02-10 19:45:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,436 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-02-10 19:45:00,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-02-10 19:45:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:00,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:00,437 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1498681168, now seen corresponding path program 243 times [2020-02-10 19:45:00,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373032250] [2020-02-10 19:45:00,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,643 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:45:00,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373032250] [2020-02-10 19:45:00,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:00,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264581380] [2020-02-10 19:45:00,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:00,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:00,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:00,644 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-02-10 19:45:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,713 INFO L93 Difference]: Finished difference Result 375 states and 962 transitions. [2020-02-10 19:45:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:00,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,714 INFO L225 Difference]: With dead ends: 375 [2020-02-10 19:45:00,714 INFO L226 Difference]: Without dead ends: 359 [2020-02-10 19:45:00,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-02-10 19:45:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 216. [2020-02-10 19:45:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-02-10 19:45:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-02-10 19:45:00,720 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-02-10 19:45:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,720 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-02-10 19:45:00,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-02-10 19:45:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:00,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:00,721 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1820081378, now seen corresponding path program 244 times [2020-02-10 19:45:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993407779] [2020-02-10 19:45:00,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,919 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:45:00,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993407779] [2020-02-10 19:45:00,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:00,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134392577] [2020-02-10 19:45:00,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:00,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:00,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:00,920 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-02-10 19:45:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,998 INFO L93 Difference]: Finished difference Result 372 states and 951 transitions. [2020-02-10 19:45:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:00,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,999 INFO L225 Difference]: With dead ends: 372 [2020-02-10 19:45:00,999 INFO L226 Difference]: Without dead ends: 353 [2020-02-10 19:45:01,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-02-10 19:45:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 210. [2020-02-10 19:45:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-02-10 19:45:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 626 transitions. [2020-02-10 19:45:01,005 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 626 transitions. Word has length 19 [2020-02-10 19:45:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,005 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 626 transitions. [2020-02-10 19:45:01,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 626 transitions. [2020-02-10 19:45:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:01,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:01,006 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:01,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -308913628, now seen corresponding path program 245 times [2020-02-10 19:45:01,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470199972] [2020-02-10 19:45:01,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:01,214 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:45:01,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470199972] [2020-02-10 19:45:01,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:01,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:01,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716087728] [2020-02-10 19:45:01,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:01,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:01,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:01,215 INFO L87 Difference]: Start difference. First operand 210 states and 626 transitions. Second operand 8 states. [2020-02-10 19:45:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,292 INFO L93 Difference]: Finished difference Result 370 states and 948 transitions. [2020-02-10 19:45:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:01,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,294 INFO L225 Difference]: With dead ends: 370 [2020-02-10 19:45:01,294 INFO L226 Difference]: Without dead ends: 356 [2020-02-10 19:45:01,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-02-10 19:45:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 215. [2020-02-10 19:45:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-02-10 19:45:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 636 transitions. [2020-02-10 19:45:01,299 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 636 transitions. Word has length 19 [2020-02-10 19:45:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,299 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 636 transitions. [2020-02-10 19:45:01,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 636 transitions. [2020-02-10 19:45:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:01,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:01,300 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash 549366256, now seen corresponding path program 246 times [2020-02-10 19:45:01,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725705554] [2020-02-10 19:45:01,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:01,506 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:45:01,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725705554] [2020-02-10 19:45:01,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:01,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:01,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166921085] [2020-02-10 19:45:01,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:01,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:01,508 INFO L87 Difference]: Start difference. First operand 215 states and 636 transitions. Second operand 8 states. [2020-02-10 19:45:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,589 INFO L93 Difference]: Finished difference Result 369 states and 941 transitions. [2020-02-10 19:45:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:01,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,590 INFO L225 Difference]: With dead ends: 369 [2020-02-10 19:45:01,591 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 19:45:01,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 19:45:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-02-10 19:45:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 19:45:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 608 transitions. [2020-02-10 19:45:01,596 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 608 transitions. Word has length 19 [2020-02-10 19:45:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,597 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 608 transitions. [2020-02-10 19:45:01,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 608 transitions. [2020-02-10 19:45:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:01,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:01,597 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash -667701144, now seen corresponding path program 247 times [2020-02-10 19:45:01,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474398567] [2020-02-10 19:45:01,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:01,807 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:45:01,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474398567] [2020-02-10 19:45:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:01,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:01,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460124266] [2020-02-10 19:45:01,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:01,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:01,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:01,808 INFO L87 Difference]: Start difference. First operand 202 states and 608 transitions. Second operand 8 states. [2020-02-10 19:45:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,871 INFO L93 Difference]: Finished difference Result 365 states and 929 transitions. [2020-02-10 19:45:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:01,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,872 INFO L225 Difference]: With dead ends: 365 [2020-02-10 19:45:01,873 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 19:45:01,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 19:45:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2020-02-10 19:45:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-02-10 19:45:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 634 transitions. [2020-02-10 19:45:01,877 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 634 transitions. Word has length 19 [2020-02-10 19:45:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,877 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 634 transitions. [2020-02-10 19:45:01,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 634 transitions. [2020-02-10 19:45:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:01,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:01,878 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,878 INFO L82 PathProgramCache]: Analyzing trace with hash -293049958, now seen corresponding path program 248 times [2020-02-10 19:45:01,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849104506] [2020-02-10 19:45:01,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,091 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:45:02,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849104506] [2020-02-10 19:45:02,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:02,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291333856] [2020-02-10 19:45:02,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:02,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:02,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:02,093 INFO L87 Difference]: Start difference. First operand 214 states and 634 transitions. Second operand 8 states. [2020-02-10 19:45:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:02,176 INFO L93 Difference]: Finished difference Result 363 states and 919 transitions. [2020-02-10 19:45:02,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:02,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:02,177 INFO L225 Difference]: With dead ends: 363 [2020-02-10 19:45:02,177 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 19:45:02,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 19:45:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 206. [2020-02-10 19:45:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 19:45:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 616 transitions. [2020-02-10 19:45:02,182 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 616 transitions. Word has length 19 [2020-02-10 19:45:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:02,182 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 616 transitions. [2020-02-10 19:45:02,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 616 transitions. [2020-02-10 19:45:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:02,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:02,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:02,183 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash -463100062, now seen corresponding path program 249 times [2020-02-10 19:45:02,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:02,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89227457] [2020-02-10 19:45:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:02,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89227457] [2020-02-10 19:45:02,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:02,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521779089] [2020-02-10 19:45:02,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:02,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:02,398 INFO L87 Difference]: Start difference. First operand 206 states and 616 transitions. Second operand 8 states. [2020-02-10 19:45:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:02,460 INFO L93 Difference]: Finished difference Result 356 states and 902 transitions. [2020-02-10 19:45:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:02,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:02,461 INFO L225 Difference]: With dead ends: 356 [2020-02-10 19:45:02,461 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 19:45:02,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 19:45:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 209. [2020-02-10 19:45:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-02-10 19:45:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 620 transitions. [2020-02-10 19:45:02,466 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 620 transitions. Word has length 19 [2020-02-10 19:45:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:02,466 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 620 transitions. [2020-02-10 19:45:02,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 620 transitions. [2020-02-10 19:45:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:02,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:02,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:02,467 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1680140688, now seen corresponding path program 250 times [2020-02-10 19:45:02,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:02,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420991997] [2020-02-10 19:45:02,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,674 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:45:02,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420991997] [2020-02-10 19:45:02,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:02,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907829761] [2020-02-10 19:45:02,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:02,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:02,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:02,676 INFO L87 Difference]: Start difference. First operand 209 states and 620 transitions. Second operand 8 states. [2020-02-10 19:45:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:02,771 INFO L93 Difference]: Finished difference Result 350 states and 887 transitions. [2020-02-10 19:45:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:02,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:02,773 INFO L225 Difference]: With dead ends: 350 [2020-02-10 19:45:02,773 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 19:45:02,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 19:45:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 206. [2020-02-10 19:45:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 19:45:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 613 transitions. [2020-02-10 19:45:02,779 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 613 transitions. Word has length 19 [2020-02-10 19:45:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:02,779 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 613 transitions. [2020-02-10 19:45:02,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 613 transitions. [2020-02-10 19:45:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:02,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:02,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:02,780 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1861116096, now seen corresponding path program 251 times [2020-02-10 19:45:02,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:02,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281898017] [2020-02-10 19:45:02,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,965 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:45:02,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281898017] [2020-02-10 19:45:02,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:02,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513917449] [2020-02-10 19:45:02,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:02,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:02,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:02,967 INFO L87 Difference]: Start difference. First operand 206 states and 613 transitions. Second operand 8 states. [2020-02-10 19:45:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,047 INFO L93 Difference]: Finished difference Result 351 states and 891 transitions. [2020-02-10 19:45:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:03,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,049 INFO L225 Difference]: With dead ends: 351 [2020-02-10 19:45:03,049 INFO L226 Difference]: Without dead ends: 337 [2020-02-10 19:45:03,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-02-10 19:45:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 208. [2020-02-10 19:45:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 19:45:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 616 transitions. [2020-02-10 19:45:03,054 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 616 transitions. Word has length 19 [2020-02-10 19:45:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,055 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 616 transitions. [2020-02-10 19:45:03,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 616 transitions. [2020-02-10 19:45:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:03,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:03,056 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1559515874, now seen corresponding path program 252 times [2020-02-10 19:45:03,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941685426] [2020-02-10 19:45:03,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:03,245 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:45:03,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941685426] [2020-02-10 19:45:03,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:03,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:03,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535561438] [2020-02-10 19:45:03,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:03,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:03,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:03,248 INFO L87 Difference]: Start difference. First operand 208 states and 616 transitions. Second operand 8 states. [2020-02-10 19:45:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,332 INFO L93 Difference]: Finished difference Result 347 states and 880 transitions. [2020-02-10 19:45:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:03,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,335 INFO L225 Difference]: With dead ends: 347 [2020-02-10 19:45:03,336 INFO L226 Difference]: Without dead ends: 331 [2020-02-10 19:45:03,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-02-10 19:45:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 202. [2020-02-10 19:45:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 19:45:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 604 transitions. [2020-02-10 19:45:03,342 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 604 transitions. Word has length 19 [2020-02-10 19:45:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,342 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 604 transitions. [2020-02-10 19:45:03,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 604 transitions. [2020-02-10 19:45:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:03,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:03,343 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1800243944, now seen corresponding path program 253 times [2020-02-10 19:45:03,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437322877] [2020-02-10 19:45:03,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:03,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437322877] [2020-02-10 19:45:03,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:03,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:03,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49675219] [2020-02-10 19:45:03,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:03,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:03,522 INFO L87 Difference]: Start difference. First operand 202 states and 604 transitions. Second operand 8 states. [2020-02-10 19:45:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,580 INFO L93 Difference]: Finished difference Result 352 states and 894 transitions. [2020-02-10 19:45:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:03,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,581 INFO L225 Difference]: With dead ends: 352 [2020-02-10 19:45:03,581 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 19:45:03,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 19:45:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 208. [2020-02-10 19:45:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-02-10 19:45:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2020-02-10 19:45:03,587 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 19 [2020-02-10 19:45:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,587 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2020-02-10 19:45:03,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2020-02-10 19:45:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:03,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:03,588 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,588 INFO L82 PathProgramCache]: Analyzing trace with hash -351482602, now seen corresponding path program 254 times [2020-02-10 19:45:03,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386704155] [2020-02-10 19:45:03,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:03,795 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:45:03,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386704155] [2020-02-10 19:45:03,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:03,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:03,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554602426] [2020-02-10 19:45:03,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:03,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:03,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:03,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:03,796 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand 8 states. [2020-02-10 19:45:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,876 INFO L93 Difference]: Finished difference Result 346 states and 879 transitions. [2020-02-10 19:45:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:03,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,878 INFO L225 Difference]: With dead ends: 346 [2020-02-10 19:45:03,878 INFO L226 Difference]: Without dead ends: 333 [2020-02-10 19:45:03,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-02-10 19:45:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2020-02-10 19:45:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 19:45:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 611 transitions. [2020-02-10 19:45:03,884 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 611 transitions. Word has length 19 [2020-02-10 19:45:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,884 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 611 transitions. [2020-02-10 19:45:03,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 611 transitions. [2020-02-10 19:45:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:03,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,884 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:03,884 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1293897678, now seen corresponding path program 255 times [2020-02-10 19:45:03,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543933310] [2020-02-10 19:45:03,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,076 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:45:04,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543933310] [2020-02-10 19:45:04,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:04,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101618153] [2020-02-10 19:45:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:04,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:04,077 INFO L87 Difference]: Start difference. First operand 205 states and 611 transitions. Second operand 8 states. [2020-02-10 19:45:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,137 INFO L93 Difference]: Finished difference Result 358 states and 908 transitions. [2020-02-10 19:45:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:04,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,138 INFO L225 Difference]: With dead ends: 358 [2020-02-10 19:45:04,138 INFO L226 Difference]: Without dead ends: 342 [2020-02-10 19:45:04,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-02-10 19:45:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 211. [2020-02-10 19:45:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 19:45:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 622 transitions. [2020-02-10 19:45:04,143 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 622 transitions. Word has length 19 [2020-02-10 19:45:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,143 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 622 transitions. [2020-02-10 19:45:04,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 622 transitions. [2020-02-10 19:45:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:04,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:04,144 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 317692928, now seen corresponding path program 256 times [2020-02-10 19:45:04,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465747990] [2020-02-10 19:45:04,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,350 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:45:04,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465747990] [2020-02-10 19:45:04,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:04,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030226481] [2020-02-10 19:45:04,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:04,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:04,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:04,351 INFO L87 Difference]: Start difference. First operand 211 states and 622 transitions. Second operand 8 states. [2020-02-10 19:45:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,429 INFO L93 Difference]: Finished difference Result 355 states and 897 transitions. [2020-02-10 19:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:04,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,430 INFO L225 Difference]: With dead ends: 355 [2020-02-10 19:45:04,430 INFO L226 Difference]: Without dead ends: 336 [2020-02-10 19:45:04,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-02-10 19:45:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 205. [2020-02-10 19:45:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 19:45:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 608 transitions. [2020-02-10 19:45:04,435 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 608 transitions. Word has length 19 [2020-02-10 19:45:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,435 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 608 transitions. [2020-02-10 19:45:04,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 608 transitions. [2020-02-10 19:45:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:04,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:04,436 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,436 INFO L82 PathProgramCache]: Analyzing trace with hash -235841100, now seen corresponding path program 257 times [2020-02-10 19:45:04,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860201030] [2020-02-10 19:45:04,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,625 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:45:04,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860201030] [2020-02-10 19:45:04,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:04,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266848961] [2020-02-10 19:45:04,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:04,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:04,626 INFO L87 Difference]: Start difference. First operand 205 states and 608 transitions. Second operand 8 states. [2020-02-10 19:45:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,717 INFO L93 Difference]: Finished difference Result 342 states and 869 transitions. [2020-02-10 19:45:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:04,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,719 INFO L225 Difference]: With dead ends: 342 [2020-02-10 19:45:04,719 INFO L226 Difference]: Without dead ends: 332 [2020-02-10 19:45:04,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-02-10 19:45:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 207. [2020-02-10 19:45:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-02-10 19:45:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 611 transitions. [2020-02-10 19:45:04,724 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 611 transitions. Word has length 19 [2020-02-10 19:45:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,724 INFO L479 AbstractCegarLoop]: Abstraction has 207 states and 611 transitions. [2020-02-10 19:45:04,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 611 transitions. [2020-02-10 19:45:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:04,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:04,725 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1964888434, now seen corresponding path program 258 times [2020-02-10 19:45:04,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597651296] [2020-02-10 19:45:04,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,908 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:45:04,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597651296] [2020-02-10 19:45:04,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:04,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382531198] [2020-02-10 19:45:04,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:04,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:04,910 INFO L87 Difference]: Start difference. First operand 207 states and 611 transitions. Second operand 8 states. [2020-02-10 19:45:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,999 INFO L93 Difference]: Finished difference Result 345 states and 874 transitions. [2020-02-10 19:45:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:05,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,001 INFO L225 Difference]: With dead ends: 345 [2020-02-10 19:45:05,001 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 19:45:05,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 19:45:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 202. [2020-02-10 19:45:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 19:45:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 601 transitions. [2020-02-10 19:45:05,007 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 601 transitions. Word has length 19 [2020-02-10 19:45:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,007 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 601 transitions. [2020-02-10 19:45:05,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 601 transitions. [2020-02-10 19:45:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:05,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:05,008 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1020844596, now seen corresponding path program 259 times [2020-02-10 19:45:05,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330005714] [2020-02-10 19:45:05,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,193 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:45:05,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330005714] [2020-02-10 19:45:05,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:05,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524414050] [2020-02-10 19:45:05,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:05,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:05,194 INFO L87 Difference]: Start difference. First operand 202 states and 601 transitions. Second operand 8 states. [2020-02-10 19:45:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:05,271 INFO L93 Difference]: Finished difference Result 342 states and 873 transitions. [2020-02-10 19:45:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:05,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,272 INFO L225 Difference]: With dead ends: 342 [2020-02-10 19:45:05,272 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 19:45:05,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 19:45:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 206. [2020-02-10 19:45:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 19:45:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 611 transitions. [2020-02-10 19:45:05,278 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 611 transitions. Word has length 19 [2020-02-10 19:45:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,278 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 611 transitions. [2020-02-10 19:45:05,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 611 transitions. [2020-02-10 19:45:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:05,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:05,279 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:05,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,279 INFO L82 PathProgramCache]: Analyzing trace with hash 146509270, now seen corresponding path program 260 times [2020-02-10 19:45:05,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107458829] [2020-02-10 19:45:05,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,454 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:45:05,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107458829] [2020-02-10 19:45:05,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:05,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446644075] [2020-02-10 19:45:05,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:05,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:05,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:05,456 INFO L87 Difference]: Start difference. First operand 206 states and 611 transitions. Second operand 8 states. [2020-02-10 19:45:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:05,542 INFO L93 Difference]: Finished difference Result 338 states and 862 transitions. [2020-02-10 19:45:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:05,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,543 INFO L225 Difference]: With dead ends: 338 [2020-02-10 19:45:05,544 INFO L226 Difference]: Without dead ends: 326 [2020-02-10 19:45:05,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-02-10 19:45:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-02-10 19:45:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-02-10 19:45:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 606 transitions. [2020-02-10 19:45:05,549 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 606 transitions. Word has length 19 [2020-02-10 19:45:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,549 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 606 transitions. [2020-02-10 19:45:05,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 606 transitions. [2020-02-10 19:45:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:05,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:05,549 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:05,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1040015206, now seen corresponding path program 261 times [2020-02-10 19:45:05,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112163202] [2020-02-10 19:45:05,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,730 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:45:05,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112163202] [2020-02-10 19:45:05,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:05,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027077406] [2020-02-10 19:45:05,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:05,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:05,732 INFO L87 Difference]: Start difference. First operand 204 states and 606 transitions. Second operand 8 states. [2020-02-10 19:45:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:05,808 INFO L93 Difference]: Finished difference Result 348 states and 888 transitions. [2020-02-10 19:45:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:05,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,809 INFO L225 Difference]: With dead ends: 348 [2020-02-10 19:45:05,809 INFO L226 Difference]: Without dead ends: 334 [2020-02-10 19:45:05,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-02-10 19:45:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 209. [2020-02-10 19:45:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-02-10 19:45:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 616 transitions. [2020-02-10 19:45:05,815 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 616 transitions. Word has length 19 [2020-02-10 19:45:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,815 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 616 transitions. [2020-02-10 19:45:05,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 616 transitions. [2020-02-10 19:45:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:05,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:05,816 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,816 INFO L82 PathProgramCache]: Analyzing trace with hash -71131166, now seen corresponding path program 262 times [2020-02-10 19:45:05,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752238084] [2020-02-10 19:45:05,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,995 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:45:05,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752238084] [2020-02-10 19:45:05,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:05,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344838579] [2020-02-10 19:45:05,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:05,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:05,996 INFO L87 Difference]: Start difference. First operand 209 states and 616 transitions. Second operand 8 states. [2020-02-10 19:45:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,080 INFO L93 Difference]: Finished difference Result 347 states and 881 transitions. [2020-02-10 19:45:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:06,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,081 INFO L225 Difference]: With dead ends: 347 [2020-02-10 19:45:06,081 INFO L226 Difference]: Without dead ends: 329 [2020-02-10 19:45:06,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-02-10 19:45:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 204. [2020-02-10 19:45:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-02-10 19:45:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 604 transitions. [2020-02-10 19:45:06,087 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 604 transitions. Word has length 19 [2020-02-10 19:45:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,087 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 604 transitions. [2020-02-10 19:45:06,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 604 transitions. [2020-02-10 19:45:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:06,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:06,088 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash 319756962, now seen corresponding path program 263 times [2020-02-10 19:45:06,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528895234] [2020-02-10 19:45:06,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,276 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:45:06,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528895234] [2020-02-10 19:45:06,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:06,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649599937] [2020-02-10 19:45:06,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:06,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:06,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:06,277 INFO L87 Difference]: Start difference. First operand 204 states and 604 transitions. Second operand 8 states. [2020-02-10 19:45:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,347 INFO L93 Difference]: Finished difference Result 337 states and 858 transitions. [2020-02-10 19:45:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:06,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,348 INFO L225 Difference]: With dead ends: 337 [2020-02-10 19:45:06,348 INFO L226 Difference]: Without dead ends: 327 [2020-02-10 19:45:06,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-02-10 19:45:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 206. [2020-02-10 19:45:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-02-10 19:45:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 607 transitions. [2020-02-10 19:45:06,354 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 607 transitions. Word has length 19 [2020-02-10 19:45:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,354 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 607 transitions. [2020-02-10 19:45:06,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 607 transitions. [2020-02-10 19:45:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:06,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:06,355 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1409290372, now seen corresponding path program 264 times [2020-02-10 19:45:06,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511724849] [2020-02-10 19:45:06,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:06,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511724849] [2020-02-10 19:45:06,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:06,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863936068] [2020-02-10 19:45:06,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:06,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:06,512 INFO L87 Difference]: Start difference. First operand 206 states and 607 transitions. Second operand 8 states. [2020-02-10 19:45:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,580 INFO L93 Difference]: Finished difference Result 340 states and 863 transitions. [2020-02-10 19:45:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:06,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,581 INFO L225 Difference]: With dead ends: 340 [2020-02-10 19:45:06,581 INFO L226 Difference]: Without dead ends: 318 [2020-02-10 19:45:06,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-02-10 19:45:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 197. [2020-02-10 19:45:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 19:45:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 591 transitions. [2020-02-10 19:45:06,586 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 591 transitions. Word has length 19 [2020-02-10 19:45:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,586 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 591 transitions. [2020-02-10 19:45:06,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 591 transitions. [2020-02-10 19:45:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:06,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:06,587 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash -666960488, now seen corresponding path program 265 times [2020-02-10 19:45:06,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108833902] [2020-02-10 19:45:06,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,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:45:06,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108833902] [2020-02-10 19:45:06,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:06,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874252219] [2020-02-10 19:45:06,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:06,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:06,813 INFO L87 Difference]: Start difference. First operand 197 states and 591 transitions. Second operand 8 states. [2020-02-10 19:45:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,869 INFO L93 Difference]: Finished difference Result 365 states and 927 transitions. [2020-02-10 19:45:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:06,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,870 INFO L225 Difference]: With dead ends: 365 [2020-02-10 19:45:06,871 INFO L226 Difference]: Without dead ends: 349 [2020-02-10 19:45:06,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-02-10 19:45:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 205. [2020-02-10 19:45:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-02-10 19:45:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 605 transitions. [2020-02-10 19:45:06,877 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 605 transitions. Word has length 19 [2020-02-10 19:45:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,877 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 605 transitions. [2020-02-10 19:45:06,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 605 transitions. [2020-02-10 19:45:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:06,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:06,878 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:06,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,878 INFO L82 PathProgramCache]: Analyzing trace with hash -292309302, now seen corresponding path program 266 times [2020-02-10 19:45:06,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365552771] [2020-02-10 19:45:06,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,096 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:45:07,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365552771] [2020-02-10 19:45:07,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:07,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214807969] [2020-02-10 19:45:07,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:07,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:07,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:07,098 INFO L87 Difference]: Start difference. First operand 205 states and 605 transitions. Second operand 8 states. [2020-02-10 19:45:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:07,174 INFO L93 Difference]: Finished difference Result 363 states and 917 transitions. [2020-02-10 19:45:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:07,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:07,175 INFO L225 Difference]: With dead ends: 363 [2020-02-10 19:45:07,175 INFO L226 Difference]: Without dead ends: 341 [2020-02-10 19:45:07,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-02-10 19:45:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 197. [2020-02-10 19:45:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 19:45:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 584 transitions. [2020-02-10 19:45:07,180 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 584 transitions. Word has length 19 [2020-02-10 19:45:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:07,180 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 584 transitions. [2020-02-10 19:45:07,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 584 transitions. [2020-02-10 19:45:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:07,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:07,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:07,181 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 514429266, now seen corresponding path program 267 times [2020-02-10 19:45:07,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:07,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329433144] [2020-02-10 19:45:07,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,404 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:45:07,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329433144] [2020-02-10 19:45:07,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:07,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998809953] [2020-02-10 19:45:07,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:07,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:07,406 INFO L87 Difference]: Start difference. First operand 197 states and 584 transitions. Second operand 8 states. [2020-02-10 19:45:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:07,463 INFO L93 Difference]: Finished difference Result 362 states and 914 transitions. [2020-02-10 19:45:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:07,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:07,464 INFO L225 Difference]: With dead ends: 362 [2020-02-10 19:45:07,464 INFO L226 Difference]: Without dead ends: 346 [2020-02-10 19:45:07,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-02-10 19:45:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 203. [2020-02-10 19:45:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-02-10 19:45:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 595 transitions. [2020-02-10 19:45:07,469 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 595 transitions. Word has length 19 [2020-02-10 19:45:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:07,469 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 595 transitions. [2020-02-10 19:45:07,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 595 transitions. [2020-02-10 19:45:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:07,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:07,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:07,470 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash -461775484, now seen corresponding path program 268 times [2020-02-10 19:45:07,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:07,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551998008] [2020-02-10 19:45:07,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,681 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:45:07,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551998008] [2020-02-10 19:45:07,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:07,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754583695] [2020-02-10 19:45:07,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:07,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:07,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:07,683 INFO L87 Difference]: Start difference. First operand 203 states and 595 transitions. Second operand 8 states. [2020-02-10 19:45:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:07,765 INFO L93 Difference]: Finished difference Result 359 states and 903 transitions. [2020-02-10 19:45:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:07,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:07,766 INFO L225 Difference]: With dead ends: 359 [2020-02-10 19:45:07,766 INFO L226 Difference]: Without dead ends: 340 [2020-02-10 19:45:07,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-02-10 19:45:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 197. [2020-02-10 19:45:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-02-10 19:45:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 578 transitions. [2020-02-10 19:45:07,771 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 578 transitions. Word has length 19 [2020-02-10 19:45:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:07,772 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 578 transitions. [2020-02-10 19:45:07,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 578 transitions. [2020-02-10 19:45:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:07,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:07,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:07,772 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1704196806, now seen corresponding path program 269 times [2020-02-10 19:45:07,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:07,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965325910] [2020-02-10 19:45:07,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,985 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:45:07,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965325910] [2020-02-10 19:45:07,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:07,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142880960] [2020-02-10 19:45:07,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:07,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:07,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:07,986 INFO L87 Difference]: Start difference. First operand 197 states and 578 transitions. Second operand 8 states. [2020-02-10 19:45:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,054 INFO L93 Difference]: Finished difference Result 357 states and 900 transitions. [2020-02-10 19:45:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:08,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,055 INFO L225 Difference]: With dead ends: 357 [2020-02-10 19:45:08,055 INFO L226 Difference]: Without dead ends: 343 [2020-02-10 19:45:08,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-02-10 19:45:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-02-10 19:45:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-02-10 19:45:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 588 transitions. [2020-02-10 19:45:08,060 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 588 transitions. Word has length 19 [2020-02-10 19:45:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,060 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 588 transitions. [2020-02-10 19:45:08,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 588 transitions. [2020-02-10 19:45:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:08,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:08,061 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1732490606, now seen corresponding path program 270 times [2020-02-10 19:45:08,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017318536] [2020-02-10 19:45:08,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:08,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017318536] [2020-02-10 19:45:08,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:08,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726924953] [2020-02-10 19:45:08,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:08,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:08,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:08,284 INFO L87 Difference]: Start difference. First operand 202 states and 588 transitions. Second operand 8 states. [2020-02-10 19:45:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,366 INFO L93 Difference]: Finished difference Result 356 states and 893 transitions. [2020-02-10 19:45:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:08,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,367 INFO L225 Difference]: With dead ends: 356 [2020-02-10 19:45:08,367 INFO L226 Difference]: Without dead ends: 330 [2020-02-10 19:45:08,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-02-10 19:45:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 189. [2020-02-10 19:45:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 560 transitions. [2020-02-10 19:45:08,371 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 560 transitions. Word has length 19 [2020-02-10 19:45:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,371 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 560 transitions. [2020-02-10 19:45:08,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 560 transitions. [2020-02-10 19:45:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:08,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:08,372 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash 710767946, now seen corresponding path program 271 times [2020-02-10 19:45:08,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561674349] [2020-02-10 19:45:08,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,604 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:45:08,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561674349] [2020-02-10 19:45:08,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:08,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756645609] [2020-02-10 19:45:08,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:08,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:08,606 INFO L87 Difference]: Start difference. First operand 189 states and 560 transitions. Second operand 8 states. [2020-02-10 19:45:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,667 INFO L93 Difference]: Finished difference Result 344 states and 860 transitions. [2020-02-10 19:45:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:08,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,668 INFO L225 Difference]: With dead ends: 344 [2020-02-10 19:45:08,669 INFO L226 Difference]: Without dead ends: 328 [2020-02-10 19:45:08,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-02-10 19:45:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 201. [2020-02-10 19:45:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-02-10 19:45:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 586 transitions. [2020-02-10 19:45:08,673 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 586 transitions. Word has length 19 [2020-02-10 19:45:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,673 INFO L479 AbstractCegarLoop]: Abstraction has 201 states and 586 transitions. [2020-02-10 19:45:08,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 586 transitions. [2020-02-10 19:45:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:08,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:08,674 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1085419132, now seen corresponding path program 272 times [2020-02-10 19:45:08,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123454216] [2020-02-10 19:45:08,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,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:45:08,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123454216] [2020-02-10 19:45:08,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:08,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930722797] [2020-02-10 19:45:08,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:08,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:08,886 INFO L87 Difference]: Start difference. First operand 201 states and 586 transitions. Second operand 8 states. [2020-02-10 19:45:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,971 INFO L93 Difference]: Finished difference Result 342 states and 850 transitions. [2020-02-10 19:45:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:08,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,972 INFO L225 Difference]: With dead ends: 342 [2020-02-10 19:45:08,972 INFO L226 Difference]: Without dead ends: 320 [2020-02-10 19:45:08,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-02-10 19:45:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 193. [2020-02-10 19:45:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 19:45:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 568 transitions. [2020-02-10 19:45:08,977 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 568 transitions. Word has length 19 [2020-02-10 19:45:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,977 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 568 transitions. [2020-02-10 19:45:08,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 568 transitions. [2020-02-10 19:45:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:08,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:08,978 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1240965252, now seen corresponding path program 273 times [2020-02-10 19:45:08,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507215804] [2020-02-10 19:45:08,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:09,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:45:09,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507215804] [2020-02-10 19:45:09,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:09,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:09,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059403724] [2020-02-10 19:45:09,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:09,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:09,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:09,190 INFO L87 Difference]: Start difference. First operand 193 states and 568 transitions. Second operand 8 states. [2020-02-10 19:45:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,251 INFO L93 Difference]: Finished difference Result 327 states and 818 transitions. [2020-02-10 19:45:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:09,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,252 INFO L225 Difference]: With dead ends: 327 [2020-02-10 19:45:09,252 INFO L226 Difference]: Without dead ends: 311 [2020-02-10 19:45:09,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-02-10 19:45:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 196. [2020-02-10 19:45:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-02-10 19:45:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 572 transitions. [2020-02-10 19:45:09,256 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 572 transitions. Word has length 19 [2020-02-10 19:45:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,257 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 572 transitions. [2020-02-10 19:45:09,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 572 transitions. [2020-02-10 19:45:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:09,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,257 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,257 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:09,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1500023478, now seen corresponding path program 274 times [2020-02-10 19:45:09,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161516818] [2020-02-10 19:45:09,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:09,451 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:45:09,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161516818] [2020-02-10 19:45:09,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:09,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:09,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418007333] [2020-02-10 19:45:09,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:09,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:09,453 INFO L87 Difference]: Start difference. First operand 196 states and 572 transitions. Second operand 8 states. [2020-02-10 19:45:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,510 INFO L93 Difference]: Finished difference Result 312 states and 794 transitions. [2020-02-10 19:45:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:09,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,511 INFO L225 Difference]: With dead ends: 312 [2020-02-10 19:45:09,511 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 19:45:09,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 19:45:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 193. [2020-02-10 19:45:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 19:45:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 565 transitions. [2020-02-10 19:45:09,516 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 565 transitions. Word has length 19 [2020-02-10 19:45:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,516 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 565 transitions. [2020-02-10 19:45:09,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 565 transitions. [2020-02-10 19:45:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:09,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,517 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1131696324, now seen corresponding path program 275 times [2020-02-10 19:45:09,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612082990] [2020-02-10 19:45:09,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:09,708 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:45:09,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612082990] [2020-02-10 19:45:09,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:09,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:09,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765636597] [2020-02-10 19:45:09,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:09,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:09,710 INFO L87 Difference]: Start difference. First operand 193 states and 565 transitions. Second operand 8 states. [2020-02-10 19:45:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,797 INFO L93 Difference]: Finished difference Result 324 states and 810 transitions. [2020-02-10 19:45:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:09,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,799 INFO L225 Difference]: With dead ends: 324 [2020-02-10 19:45:09,799 INFO L226 Difference]: Without dead ends: 310 [2020-02-10 19:45:09,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-02-10 19:45:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 195. [2020-02-10 19:45:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 19:45:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 568 transitions. [2020-02-10 19:45:09,805 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 568 transitions. Word has length 19 [2020-02-10 19:45:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,805 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 568 transitions. [2020-02-10 19:45:09,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 568 transitions. [2020-02-10 19:45:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:09,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,806 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash -11566494, now seen corresponding path program 276 times [2020-02-10 19:45:09,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095297521] [2020-02-10 19:45:09,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,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:45:10,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095297521] [2020-02-10 19:45:10,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:10,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363410750] [2020-02-10 19:45:10,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:10,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:10,049 INFO L87 Difference]: Start difference. First operand 195 states and 568 transitions. Second operand 8 states. [2020-02-10 19:45:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,122 INFO L93 Difference]: Finished difference Result 311 states and 790 transitions. [2020-02-10 19:45:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:10,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,124 INFO L225 Difference]: With dead ends: 311 [2020-02-10 19:45:10,124 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 19:45:10,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 19:45:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-02-10 19:45:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 556 transitions. [2020-02-10 19:45:10,127 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 556 transitions. Word has length 19 [2020-02-10 19:45:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,127 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 556 transitions. [2020-02-10 19:45:10,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 556 transitions. [2020-02-10 19:45:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:10,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:10,128 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash -790658038, now seen corresponding path program 277 times [2020-02-10 19:45:10,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870665575] [2020-02-10 19:45:10,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,325 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:45:10,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870665575] [2020-02-10 19:45:10,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:10,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761408168] [2020-02-10 19:45:10,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:10,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:10,326 INFO L87 Difference]: Start difference. First operand 189 states and 556 transitions. Second operand 8 states. [2020-02-10 19:45:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,387 INFO L93 Difference]: Finished difference Result 339 states and 846 transitions. [2020-02-10 19:45:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:10,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,388 INFO L225 Difference]: With dead ends: 339 [2020-02-10 19:45:10,388 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 19:45:10,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 19:45:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2020-02-10 19:45:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 19:45:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2020-02-10 19:45:10,392 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 19 [2020-02-10 19:45:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,392 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2020-02-10 19:45:10,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2020-02-10 19:45:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:10,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:10,393 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash -531599812, now seen corresponding path program 278 times [2020-02-10 19:45:10,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283180938] [2020-02-10 19:45:10,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:10,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283180938] [2020-02-10 19:45:10,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:10,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487720764] [2020-02-10 19:45:10,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:10,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:10,591 INFO L87 Difference]: Start difference. First operand 195 states and 570 transitions. Second operand 8 states. [2020-02-10 19:45:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,649 INFO L93 Difference]: Finished difference Result 333 states and 831 transitions. [2020-02-10 19:45:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:10,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,650 INFO L225 Difference]: With dead ends: 333 [2020-02-10 19:45:10,650 INFO L226 Difference]: Without dead ends: 320 [2020-02-10 19:45:10,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-02-10 19:45:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 192. [2020-02-10 19:45:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 563 transitions. [2020-02-10 19:45:10,656 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 563 transitions. Word has length 19 [2020-02-10 19:45:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,656 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 563 transitions. [2020-02-10 19:45:10,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 563 transitions. [2020-02-10 19:45:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:10,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:10,657 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 303433550, now seen corresponding path program 279 times [2020-02-10 19:45:10,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147285350] [2020-02-10 19:45:10,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:10,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147285350] [2020-02-10 19:45:10,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:10,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561254202] [2020-02-10 19:45:10,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:10,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:10,857 INFO L87 Difference]: Start difference. First operand 192 states and 563 transitions. Second operand 8 states. [2020-02-10 19:45:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,942 INFO L93 Difference]: Finished difference Result 339 states and 843 transitions. [2020-02-10 19:45:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:10,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,943 INFO L225 Difference]: With dead ends: 339 [2020-02-10 19:45:10,943 INFO L226 Difference]: Without dead ends: 323 [2020-02-10 19:45:10,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-02-10 19:45:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 198. [2020-02-10 19:45:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-02-10 19:45:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 574 transitions. [2020-02-10 19:45:10,948 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 574 transitions. Word has length 19 [2020-02-10 19:45:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,948 INFO L479 AbstractCegarLoop]: Abstraction has 198 states and 574 transitions. [2020-02-10 19:45:10,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 574 transitions. [2020-02-10 19:45:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:10,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:10,949 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:10,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash -672771200, now seen corresponding path program 280 times [2020-02-10 19:45:10,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975905954] [2020-02-10 19:45:10,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,147 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:45:11,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975905954] [2020-02-10 19:45:11,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:11,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381437369] [2020-02-10 19:45:11,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:11,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:11,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:11,149 INFO L87 Difference]: Start difference. First operand 198 states and 574 transitions. Second operand 8 states. [2020-02-10 19:45:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:11,229 INFO L93 Difference]: Finished difference Result 336 states and 832 transitions. [2020-02-10 19:45:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:11,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:11,231 INFO L225 Difference]: With dead ends: 336 [2020-02-10 19:45:11,231 INFO L226 Difference]: Without dead ends: 317 [2020-02-10 19:45:11,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-02-10 19:45:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 192. [2020-02-10 19:45:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-02-10 19:45:11,236 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-02-10 19:45:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:11,236 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-02-10 19:45:11,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-02-10 19:45:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:11,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:11,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:11,237 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:11,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1980171160, now seen corresponding path program 281 times [2020-02-10 19:45:11,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:11,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108939912] [2020-02-10 19:45:11,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,454 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:45:11,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108939912] [2020-02-10 19:45:11,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:11,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553802109] [2020-02-10 19:45:11,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:11,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:11,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:11,456 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-02-10 19:45:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:11,513 INFO L93 Difference]: Finished difference Result 323 states and 804 transitions. [2020-02-10 19:45:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:11,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:11,514 INFO L225 Difference]: With dead ends: 323 [2020-02-10 19:45:11,514 INFO L226 Difference]: Without dead ends: 313 [2020-02-10 19:45:11,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-02-10 19:45:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 194. [2020-02-10 19:45:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 19:45:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-02-10 19:45:11,519 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-02-10 19:45:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:11,519 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-02-10 19:45:11,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-02-10 19:45:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:11,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:11,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:11,520 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:11,520 INFO L82 PathProgramCache]: Analyzing trace with hash -490766164, now seen corresponding path program 282 times [2020-02-10 19:45:11,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:11,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984426777] [2020-02-10 19:45:11,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,712 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:45:11,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984426777] [2020-02-10 19:45:11,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:11,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664112891] [2020-02-10 19:45:11,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:11,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:11,714 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-02-10 19:45:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:11,792 INFO L93 Difference]: Finished difference Result 321 states and 799 transitions. [2020-02-10 19:45:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:11,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:11,793 INFO L225 Difference]: With dead ends: 321 [2020-02-10 19:45:11,793 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 19:45:11,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 19:45:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 189. [2020-02-10 19:45:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-02-10 19:45:11,798 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-02-10 19:45:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:11,798 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-02-10 19:45:11,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-02-10 19:45:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:11,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:11,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:11,799 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash 504306274, now seen corresponding path program 283 times [2020-02-10 19:45:11,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:11,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435059134] [2020-02-10 19:45:11,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,987 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:45:11,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435059134] [2020-02-10 19:45:11,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:11,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356454023] [2020-02-10 19:45:11,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:11,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:11,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:11,988 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-02-10 19:45:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,065 INFO L93 Difference]: Finished difference Result 329 states and 825 transitions. [2020-02-10 19:45:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:12,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,066 INFO L225 Difference]: With dead ends: 329 [2020-02-10 19:45:12,066 INFO L226 Difference]: Without dead ends: 315 [2020-02-10 19:45:12,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-02-10 19:45:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 193. [2020-02-10 19:45:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 19:45:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 563 transitions. [2020-02-10 19:45:12,071 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 563 transitions. Word has length 19 [2020-02-10 19:45:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,071 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 563 transitions. [2020-02-10 19:45:12,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 563 transitions. [2020-02-10 19:45:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:12,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:12,072 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1624436104, now seen corresponding path program 284 times [2020-02-10 19:45:12,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311459926] [2020-02-10 19:45:12,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,288 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:45:12,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311459926] [2020-02-10 19:45:12,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:12,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036091784] [2020-02-10 19:45:12,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:12,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:12,290 INFO L87 Difference]: Start difference. First operand 193 states and 563 transitions. Second operand 8 states. [2020-02-10 19:45:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,352 INFO L93 Difference]: Finished difference Result 325 states and 814 transitions. [2020-02-10 19:45:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:12,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,353 INFO L225 Difference]: With dead ends: 325 [2020-02-10 19:45:12,353 INFO L226 Difference]: Without dead ends: 313 [2020-02-10 19:45:12,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-02-10 19:45:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 191. [2020-02-10 19:45:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-02-10 19:45:12,358 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-02-10 19:45:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,359 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-02-10 19:45:12,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-02-10 19:45:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:12,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:12,359 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash -568779106, now seen corresponding path program 285 times [2020-02-10 19:45:12,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017601316] [2020-02-10 19:45:12,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,559 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:45:12,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017601316] [2020-02-10 19:45:12,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:12,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448692926] [2020-02-10 19:45:12,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:12,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:12,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:12,560 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-02-10 19:45:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,644 INFO L93 Difference]: Finished difference Result 330 states and 825 transitions. [2020-02-10 19:45:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:12,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,645 INFO L225 Difference]: With dead ends: 330 [2020-02-10 19:45:12,645 INFO L226 Difference]: Without dead ends: 316 [2020-02-10 19:45:12,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-02-10 19:45:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 196. [2020-02-10 19:45:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-02-10 19:45:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 568 transitions. [2020-02-10 19:45:12,651 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 568 transitions. Word has length 19 [2020-02-10 19:45:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,651 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 568 transitions. [2020-02-10 19:45:12,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 568 transitions. [2020-02-10 19:45:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:12,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:12,652 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1210836024, now seen corresponding path program 286 times [2020-02-10 19:45:12,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771690286] [2020-02-10 19:45:12,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,860 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:45:12,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771690286] [2020-02-10 19:45:12,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:12,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385871996] [2020-02-10 19:45:12,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:12,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:12,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:12,862 INFO L87 Difference]: Start difference. First operand 196 states and 568 transitions. Second operand 8 states. [2020-02-10 19:45:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,954 INFO L93 Difference]: Finished difference Result 329 states and 818 transitions. [2020-02-10 19:45:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:12,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,955 INFO L225 Difference]: With dead ends: 329 [2020-02-10 19:45:12,955 INFO L226 Difference]: Without dead ends: 311 [2020-02-10 19:45:12,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-02-10 19:45:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 191. [2020-02-10 19:45:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 19:45:12,961 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 19:45:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,961 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 19:45:12,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 19:45:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:12,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:12,962 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1594820036, now seen corresponding path program 287 times [2020-02-10 19:45:12,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478315368] [2020-02-10 19:45:12,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,169 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:45:13,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478315368] [2020-02-10 19:45:13,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:13,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132805013] [2020-02-10 19:45:13,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:13,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:13,170 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 19:45:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,248 INFO L93 Difference]: Finished difference Result 319 states and 795 transitions. [2020-02-10 19:45:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:13,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,249 INFO L225 Difference]: With dead ends: 319 [2020-02-10 19:45:13,249 INFO L226 Difference]: Without dead ends: 309 [2020-02-10 19:45:13,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-02-10 19:45:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 193. [2020-02-10 19:45:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 19:45:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-02-10 19:45:13,255 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-02-10 19:45:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:13,255 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-02-10 19:45:13,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-02-10 19:45:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:13,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:13,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:13,256 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash -105415040, now seen corresponding path program 288 times [2020-02-10 19:45:13,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:13,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797386912] [2020-02-10 19:45:13,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,458 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:45:13,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797386912] [2020-02-10 19:45:13,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:13,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251571543] [2020-02-10 19:45:13,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:13,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:13,459 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-02-10 19:45:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,541 INFO L93 Difference]: Finished difference Result 317 states and 790 transitions. [2020-02-10 19:45:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:13,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,542 INFO L225 Difference]: With dead ends: 317 [2020-02-10 19:45:13,542 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 19:45:13,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 19:45:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 19:45:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2020-02-10 19:45:13,548 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 19 [2020-02-10 19:45:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:13,548 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2020-02-10 19:45:13,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2020-02-10 19:45:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:13,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:13,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:13,549 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash -907792650, now seen corresponding path program 289 times [2020-02-10 19:45:13,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:13,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664222013] [2020-02-10 19:45:13,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,766 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:45:13,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664222013] [2020-02-10 19:45:13,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:13,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257743428] [2020-02-10 19:45:13,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:13,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:13,767 INFO L87 Difference]: Start difference. First operand 184 states and 543 transitions. Second operand 8 states. [2020-02-10 19:45:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,831 INFO L93 Difference]: Finished difference Result 330 states and 816 transitions. [2020-02-10 19:45:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:13,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,833 INFO L225 Difference]: With dead ends: 330 [2020-02-10 19:45:13,833 INFO L226 Difference]: Without dead ends: 314 [2020-02-10 19:45:13,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-02-10 19:45:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 199. [2020-02-10 19:45:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-02-10 19:45:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2020-02-10 19:45:13,838 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 19 [2020-02-10 19:45:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:13,838 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2020-02-10 19:45:13,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2020-02-10 19:45:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:13,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:13,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:13,839 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash -533141464, now seen corresponding path program 290 times [2020-02-10 19:45:13,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:13,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819470767] [2020-02-10 19:45:13,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,052 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:45:14,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819470767] [2020-02-10 19:45:14,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:14,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425797800] [2020-02-10 19:45:14,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:14,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:14,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:14,053 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand 8 states. [2020-02-10 19:45:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,152 INFO L93 Difference]: Finished difference Result 328 states and 806 transitions. [2020-02-10 19:45:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:14,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,153 INFO L225 Difference]: With dead ends: 328 [2020-02-10 19:45:14,153 INFO L226 Difference]: Without dead ends: 306 [2020-02-10 19:45:14,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-02-10 19:45:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 191. [2020-02-10 19:45:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 562 transitions. [2020-02-10 19:45:14,158 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 562 transitions. Word has length 19 [2020-02-10 19:45:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,159 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 562 transitions. [2020-02-10 19:45:14,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 562 transitions. [2020-02-10 19:45:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:14,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:14,160 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:14,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash -703191568, now seen corresponding path program 291 times [2020-02-10 19:45:14,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966782123] [2020-02-10 19:45:14,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,368 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:45:14,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966782123] [2020-02-10 19:45:14,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:14,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617942358] [2020-02-10 19:45:14,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:14,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:14,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:14,370 INFO L87 Difference]: Start difference. First operand 191 states and 562 transitions. Second operand 8 states. [2020-02-10 19:45:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,439 INFO L93 Difference]: Finished difference Result 321 states and 789 transitions. [2020-02-10 19:45:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:14,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,441 INFO L225 Difference]: With dead ends: 321 [2020-02-10 19:45:14,441 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 19:45:14,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 19:45:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 194. [2020-02-10 19:45:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 19:45:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 566 transitions. [2020-02-10 19:45:14,445 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 566 transitions. Word has length 19 [2020-02-10 19:45:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,445 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 566 transitions. [2020-02-10 19:45:14,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 566 transitions. [2020-02-10 19:45:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:14,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:14,446 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1440049182, now seen corresponding path program 292 times [2020-02-10 19:45:14,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704342428] [2020-02-10 19:45:14,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,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:45:14,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704342428] [2020-02-10 19:45:14,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:14,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237865260] [2020-02-10 19:45:14,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:14,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:14,630 INFO L87 Difference]: Start difference. First operand 194 states and 566 transitions. Second operand 8 states. [2020-02-10 19:45:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,720 INFO L93 Difference]: Finished difference Result 315 states and 774 transitions. [2020-02-10 19:45:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:14,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,721 INFO L225 Difference]: With dead ends: 315 [2020-02-10 19:45:14,721 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 19:45:14,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 19:45:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 191. [2020-02-10 19:45:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-02-10 19:45:14,726 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-02-10 19:45:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,726 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-02-10 19:45:14,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-02-10 19:45:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:14,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:14,727 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2101207602, now seen corresponding path program 293 times [2020-02-10 19:45:14,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978387656] [2020-02-10 19:45:14,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,913 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:45:14,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978387656] [2020-02-10 19:45:14,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:14,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832813222] [2020-02-10 19:45:14,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:14,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:14,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:14,915 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-02-10 19:45:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,996 INFO L93 Difference]: Finished difference Result 316 states and 778 transitions. [2020-02-10 19:45:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:14,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,997 INFO L225 Difference]: With dead ends: 316 [2020-02-10 19:45:14,997 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 19:45:14,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 19:45:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 193. [2020-02-10 19:45:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 19:45:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 562 transitions. [2020-02-10 19:45:15,002 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 562 transitions. Word has length 19 [2020-02-10 19:45:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,002 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 562 transitions. [2020-02-10 19:45:15,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 562 transitions. [2020-02-10 19:45:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:15,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:15,003 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1319424368, now seen corresponding path program 294 times [2020-02-10 19:45:15,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464058834] [2020-02-10 19:45:15,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,196 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:45:15,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464058834] [2020-02-10 19:45:15,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:15,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892062928] [2020-02-10 19:45:15,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:15,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:15,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:15,197 INFO L87 Difference]: Start difference. First operand 193 states and 562 transitions. Second operand 8 states. [2020-02-10 19:45:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,276 INFO L93 Difference]: Finished difference Result 312 states and 767 transitions. [2020-02-10 19:45:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:15,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,277 INFO L225 Difference]: With dead ends: 312 [2020-02-10 19:45:15,278 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 19:45:15,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 19:45:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 187. [2020-02-10 19:45:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 551 transitions. [2020-02-10 19:45:15,282 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 551 transitions. Word has length 19 [2020-02-10 19:45:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,282 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 551 transitions. [2020-02-10 19:45:15,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 551 transitions. [2020-02-10 19:45:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:15,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:15,283 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1330278376, now seen corresponding path program 295 times [2020-02-10 19:45:15,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069300128] [2020-02-10 19:45:15,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:15,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069300128] [2020-02-10 19:45:15,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:15,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714977910] [2020-02-10 19:45:15,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:15,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:15,534 INFO L87 Difference]: Start difference. First operand 187 states and 551 transitions. Second operand 8 states. [2020-02-10 19:45:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,597 INFO L93 Difference]: Finished difference Result 318 states and 780 transitions. [2020-02-10 19:45:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:15,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,598 INFO L225 Difference]: With dead ends: 318 [2020-02-10 19:45:15,599 INFO L226 Difference]: Without dead ends: 302 [2020-02-10 19:45:15,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-02-10 19:45:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 199. [2020-02-10 19:45:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-02-10 19:45:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 577 transitions. [2020-02-10 19:45:15,604 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 577 transitions. Word has length 19 [2020-02-10 19:45:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,604 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 577 transitions. [2020-02-10 19:45:15,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 577 transitions. [2020-02-10 19:45:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:15,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:15,605 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash -955627190, now seen corresponding path program 296 times [2020-02-10 19:45:15,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631403705] [2020-02-10 19:45:15,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,815 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:45:15,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631403705] [2020-02-10 19:45:15,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:15,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852323217] [2020-02-10 19:45:15,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:15,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:15,816 INFO L87 Difference]: Start difference. First operand 199 states and 577 transitions. Second operand 8 states. [2020-02-10 19:45:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,891 INFO L93 Difference]: Finished difference Result 316 states and 770 transitions. [2020-02-10 19:45:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:15,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,892 INFO L225 Difference]: With dead ends: 316 [2020-02-10 19:45:15,892 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 19:45:15,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 19:45:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-02-10 19:45:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-02-10 19:45:15,897 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-02-10 19:45:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,897 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-02-10 19:45:15,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-02-10 19:45:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:15,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:15,898 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash -800081070, now seen corresponding path program 297 times [2020-02-10 19:45:15,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070606466] [2020-02-10 19:45:15,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,096 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:45:16,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070606466] [2020-02-10 19:45:16,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:16,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187623503] [2020-02-10 19:45:16,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:16,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:16,098 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-02-10 19:45:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,169 INFO L93 Difference]: Finished difference Result 301 states and 738 transitions. [2020-02-10 19:45:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:16,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,171 INFO L225 Difference]: With dead ends: 301 [2020-02-10 19:45:16,171 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 19:45:16,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 19:45:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 194. [2020-02-10 19:45:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-02-10 19:45:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-02-10 19:45:16,176 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-02-10 19:45:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,176 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-02-10 19:45:16,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-02-10 19:45:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:16,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:16,177 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash -541022844, now seen corresponding path program 298 times [2020-02-10 19:45:16,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809535946] [2020-02-10 19:45:16,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,385 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:45:16,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809535946] [2020-02-10 19:45:16,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:16,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185234820] [2020-02-10 19:45:16,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:16,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:16,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:16,387 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-02-10 19:45:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,445 INFO L93 Difference]: Finished difference Result 286 states and 714 transitions. [2020-02-10 19:45:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:16,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,446 INFO L225 Difference]: With dead ends: 286 [2020-02-10 19:45:16,447 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 19:45:16,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 19:45:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 191. [2020-02-10 19:45:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 19:45:16,452 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 19:45:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,452 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 19:45:16,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 19:45:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:16,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:16,453 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1122224650, now seen corresponding path program 299 times [2020-02-10 19:45:16,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749247985] [2020-02-10 19:45:16,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,646 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:45:16,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749247985] [2020-02-10 19:45:16,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:16,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716166803] [2020-02-10 19:45:16,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:16,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:16,648 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 19:45:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,730 INFO L93 Difference]: Finished difference Result 298 states and 730 transitions. [2020-02-10 19:45:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:16,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,732 INFO L225 Difference]: With dead ends: 298 [2020-02-10 19:45:16,732 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 19:45:16,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 19:45:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 193. [2020-02-10 19:45:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-02-10 19:45:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-02-10 19:45:16,737 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-02-10 19:45:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,737 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-02-10 19:45:16,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-02-10 19:45:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:16,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:16,738 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:16,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2052612816, now seen corresponding path program 300 times [2020-02-10 19:45:16,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720162267] [2020-02-10 19:45:16,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,948 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:45:16,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720162267] [2020-02-10 19:45:16,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:16,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437975322] [2020-02-10 19:45:16,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:16,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:16,949 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-02-10 19:45:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,017 INFO L93 Difference]: Finished difference Result 285 states and 710 transitions. [2020-02-10 19:45:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:17,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,018 INFO L225 Difference]: With dead ends: 285 [2020-02-10 19:45:17,018 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 19:45:17,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 19:45:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 187. [2020-02-10 19:45:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 548 transitions. [2020-02-10 19:45:17,023 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 548 transitions. Word has length 19 [2020-02-10 19:45:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,023 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 548 transitions. [2020-02-10 19:45:17,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 548 transitions. [2020-02-10 19:45:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:17,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:17,024 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1446944266, now seen corresponding path program 301 times [2020-02-10 19:45:17,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245697902] [2020-02-10 19:45:17,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:17,223 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:45:17,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245697902] [2020-02-10 19:45:17,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:17,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:17,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106212282] [2020-02-10 19:45:17,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:17,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:17,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:17,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:17,224 INFO L87 Difference]: Start difference. First operand 187 states and 548 transitions. Second operand 8 states. [2020-02-10 19:45:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,297 INFO L93 Difference]: Finished difference Result 294 states and 721 transitions. [2020-02-10 19:45:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:17,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,298 INFO L225 Difference]: With dead ends: 294 [2020-02-10 19:45:17,298 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 19:45:17,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 19:45:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 192. [2020-02-10 19:45:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-02-10 19:45:17,302 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-02-10 19:45:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,303 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-02-10 19:45:17,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-02-10 19:45:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:17,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:17,303 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash 696296484, now seen corresponding path program 302 times [2020-02-10 19:45:17,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643961982] [2020-02-10 19:45:17,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:17,497 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:45:17,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643961982] [2020-02-10 19:45:17,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:17,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:17,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418416015] [2020-02-10 19:45:17,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:17,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:17,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:17,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:17,498 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-02-10 19:45:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,595 INFO L93 Difference]: Finished difference Result 288 states and 706 transitions. [2020-02-10 19:45:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:17,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,596 INFO L225 Difference]: With dead ends: 288 [2020-02-10 19:45:17,596 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 19:45:17,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 19:45:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-02-10 19:45:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 552 transitions. [2020-02-10 19:45:17,600 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 552 transitions. Word has length 19 [2020-02-10 19:45:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,600 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 552 transitions. [2020-02-10 19:45:17,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 552 transitions. [2020-02-10 19:45:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:17,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:17,601 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1247585176, now seen corresponding path program 303 times [2020-02-10 19:45:17,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684470840] [2020-02-10 19:45:17,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:17,792 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:45:17,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684470840] [2020-02-10 19:45:17,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:17,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:17,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256298990] [2020-02-10 19:45:17,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:17,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:17,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:17,793 INFO L87 Difference]: Start difference. First operand 189 states and 552 transitions. Second operand 8 states. [2020-02-10 19:45:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,866 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-02-10 19:45:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:17,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,867 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:17,867 INFO L226 Difference]: Without dead ends: 267 [2020-02-10 19:45:17,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-02-10 19:45:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 192. [2020-02-10 19:45:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 19:45:17,871 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 19:45:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,871 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 19:45:17,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 19:45:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:17,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:17,872 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1506643402, now seen corresponding path program 304 times [2020-02-10 19:45:17,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519793748] [2020-02-10 19:45:17,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,068 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:45:18,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519793748] [2020-02-10 19:45:18,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:18,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562407087] [2020-02-10 19:45:18,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:18,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:18,070 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 19:45:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,131 INFO L93 Difference]: Finished difference Result 268 states and 673 transitions. [2020-02-10 19:45:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:18,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,132 INFO L225 Difference]: With dead ends: 268 [2020-02-10 19:45:18,132 INFO L226 Difference]: Without dead ends: 255 [2020-02-10 19:45:18,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-02-10 19:45:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-02-10 19:45:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 19:45:18,137 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 19:45:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,137 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 19:45:18,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 19:45:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:18,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:18,138 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 266205080, now seen corresponding path program 305 times [2020-02-10 19:45:18,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74558984] [2020-02-10 19:45:18,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,335 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:45:18,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74558984] [2020-02-10 19:45:18,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:18,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74557322] [2020-02-10 19:45:18,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:18,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:18,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:18,337 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 19:45:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,410 INFO L93 Difference]: Finished difference Result 266 states and 669 transitions. [2020-02-10 19:45:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:18,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,411 INFO L225 Difference]: With dead ends: 266 [2020-02-10 19:45:18,411 INFO L226 Difference]: Without dead ends: 256 [2020-02-10 19:45:18,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-02-10 19:45:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 190. [2020-02-10 19:45:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 19:45:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-02-10 19:45:18,416 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-02-10 19:45:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,417 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-02-10 19:45:18,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-02-10 19:45:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:18,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:18,418 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,418 INFO L82 PathProgramCache]: Analyzing trace with hash 26562742, now seen corresponding path program 306 times [2020-02-10 19:45:18,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424108924] [2020-02-10 19:45:18,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,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:45:18,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424108924] [2020-02-10 19:45:18,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:18,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059408006] [2020-02-10 19:45:18,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:18,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:18,645 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-02-10 19:45:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,700 INFO L93 Difference]: Finished difference Result 255 states and 656 transitions. [2020-02-10 19:45:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:18,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,701 INFO L225 Difference]: With dead ends: 255 [2020-02-10 19:45:18,701 INFO L226 Difference]: Without dead ends: 242 [2020-02-10 19:45:18,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-02-10 19:45:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 187. [2020-02-10 19:45:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-02-10 19:45:18,706 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-02-10 19:45:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,706 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-02-10 19:45:18,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-02-10 19:45:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:18,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:18,707 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1887873640, now seen corresponding path program 307 times [2020-02-10 19:45:18,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529959500] [2020-02-10 19:45:18,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:18,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529959500] [2020-02-10 19:45:18,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:18,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045502255] [2020-02-10 19:45:18,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:18,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:18,895 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-02-10 19:45:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,973 INFO L93 Difference]: Finished difference Result 287 states and 706 transitions. [2020-02-10 19:45:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:18,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,974 INFO L225 Difference]: With dead ends: 287 [2020-02-10 19:45:18,974 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 19:45:18,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 19:45:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2020-02-10 19:45:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 19:45:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 552 transitions. [2020-02-10 19:45:18,979 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 552 transitions. Word has length 19 [2020-02-10 19:45:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,979 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 552 transitions. [2020-02-10 19:45:18,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 552 transitions. [2020-02-10 19:45:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:18,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:18,979 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1013538314, now seen corresponding path program 308 times [2020-02-10 19:45:18,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995528675] [2020-02-10 19:45:18,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,163 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:45:19,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995528675] [2020-02-10 19:45:19,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258538367] [2020-02-10 19:45:19,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:19,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:19,164 INFO L87 Difference]: Start difference. First operand 190 states and 552 transitions. Second operand 8 states. [2020-02-10 19:45:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,247 INFO L93 Difference]: Finished difference Result 283 states and 695 transitions. [2020-02-10 19:45:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:19,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,248 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:19,248 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 19:45:19,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 19:45:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 188. [2020-02-10 19:45:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-02-10 19:45:19,253 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-02-10 19:45:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,253 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-02-10 19:45:19,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-02-10 19:45:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:19,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:19,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:19,254 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1246071542, now seen corresponding path program 309 times [2020-02-10 19:45:19,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428583694] [2020-02-10 19:45:19,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:19,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428583694] [2020-02-10 19:45:19,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:19,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255841806] [2020-02-10 19:45:19,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:19,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:19,445 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-02-10 19:45:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,524 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-02-10 19:45:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:19,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,525 INFO L225 Difference]: With dead ends: 279 [2020-02-10 19:45:19,525 INFO L226 Difference]: Without dead ends: 265 [2020-02-10 19:45:19,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-02-10 19:45:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 190. [2020-02-10 19:45:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-02-10 19:45:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-02-10 19:45:19,530 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-02-10 19:45:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,530 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-02-10 19:45:19,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-02-10 19:45:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:19,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:19,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:19,531 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash -125941712, now seen corresponding path program 310 times [2020-02-10 19:45:19,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793423354] [2020-02-10 19:45:19,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,724 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:45:19,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793423354] [2020-02-10 19:45:19,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:19,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792093974] [2020-02-10 19:45:19,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:19,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:19,726 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-02-10 19:45:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,807 INFO L93 Difference]: Finished difference Result 266 states and 668 transitions. [2020-02-10 19:45:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:19,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,808 INFO L225 Difference]: With dead ends: 266 [2020-02-10 19:45:19,809 INFO L226 Difference]: Without dead ends: 254 [2020-02-10 19:45:19,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-02-10 19:45:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 188. [2020-02-10 19:45:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-02-10 19:45:19,814 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-02-10 19:45:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,814 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-02-10 19:45:19,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-02-10 19:45:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:19,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:19,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:19,814 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash 651556204, now seen corresponding path program 311 times [2020-02-10 19:45:19,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241754628] [2020-02-10 19:45:19,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,013 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:45:20,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241754628] [2020-02-10 19:45:20,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:20,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970029382] [2020-02-10 19:45:20,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:20,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:20,014 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-02-10 19:45:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,098 INFO L93 Difference]: Finished difference Result 265 states and 666 transitions. [2020-02-10 19:45:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:20,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,100 INFO L225 Difference]: With dead ends: 265 [2020-02-10 19:45:20,100 INFO L226 Difference]: Without dead ends: 255 [2020-02-10 19:45:20,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-02-10 19:45:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-02-10 19:45:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-02-10 19:45:20,104 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-02-10 19:45:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,104 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-02-10 19:45:20,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-02-10 19:45:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:20,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:20,105 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash 411913866, now seen corresponding path program 312 times [2020-02-10 19:45:20,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152669559] [2020-02-10 19:45:20,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:20,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152669559] [2020-02-10 19:45:20,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:20,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040661181] [2020-02-10 19:45:20,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:20,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:20,311 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-02-10 19:45:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,379 INFO L93 Difference]: Finished difference Result 254 states and 653 transitions. [2020-02-10 19:45:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:20,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,380 INFO L225 Difference]: With dead ends: 254 [2020-02-10 19:45:20,381 INFO L226 Difference]: Without dead ends: 239 [2020-02-10 19:45:20,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-02-10 19:45:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 184. [2020-02-10 19:45:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 540 transitions. [2020-02-10 19:45:20,385 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 540 transitions. Word has length 19 [2020-02-10 19:45:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,385 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 540 transitions. [2020-02-10 19:45:20,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 540 transitions. [2020-02-10 19:45:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:20,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:20,386 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:20,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2756816, now seen corresponding path program 313 times [2020-02-10 19:45:20,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139237447] [2020-02-10 19:45:20,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,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:45:20,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139237447] [2020-02-10 19:45:20,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:20,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467972462] [2020-02-10 19:45:20,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:20,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:20,577 INFO L87 Difference]: Start difference. First operand 184 states and 540 transitions. Second operand 8 states. [2020-02-10 19:45:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,640 INFO L93 Difference]: Finished difference Result 315 states and 778 transitions. [2020-02-10 19:45:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:20,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,641 INFO L225 Difference]: With dead ends: 315 [2020-02-10 19:45:20,642 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 19:45:20,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 19:45:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-02-10 19:45:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-02-10 19:45:20,647 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-02-10 19:45:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,647 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-02-10 19:45:20,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-02-10 19:45:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:20,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:20,648 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2140483934, now seen corresponding path program 314 times [2020-02-10 19:45:20,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209049180] [2020-02-10 19:45:20,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,839 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:45:20,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209049180] [2020-02-10 19:45:20,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:20,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697712501] [2020-02-10 19:45:20,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:20,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:20,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:20,840 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-02-10 19:45:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,928 INFO L93 Difference]: Finished difference Result 309 states and 763 transitions. [2020-02-10 19:45:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:20,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,929 INFO L225 Difference]: With dead ends: 309 [2020-02-10 19:45:20,930 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 19:45:20,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 19:45:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-02-10 19:45:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 552 transitions. [2020-02-10 19:45:20,934 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 552 transitions. Word has length 19 [2020-02-10 19:45:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,934 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 552 transitions. [2020-02-10 19:45:20,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 552 transitions. [2020-02-10 19:45:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:20,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:20,935 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1603194670, now seen corresponding path program 315 times [2020-02-10 19:45:20,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762272605] [2020-02-10 19:45:20,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,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:45:21,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762272605] [2020-02-10 19:45:21,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:21,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583843394] [2020-02-10 19:45:21,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:21,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:21,123 INFO L87 Difference]: Start difference. First operand 188 states and 552 transitions. Second operand 8 states. [2020-02-10 19:45:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,184 INFO L93 Difference]: Finished difference Result 315 states and 776 transitions. [2020-02-10 19:45:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:21,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,185 INFO L225 Difference]: With dead ends: 315 [2020-02-10 19:45:21,185 INFO L226 Difference]: Without dead ends: 299 [2020-02-10 19:45:21,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-02-10 19:45:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-02-10 19:45:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-02-10 19:45:21,190 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-02-10 19:45:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,190 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-02-10 19:45:21,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-02-10 19:45:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:21,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:21,191 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1344136444, now seen corresponding path program 316 times [2020-02-10 19:45:21,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849634146] [2020-02-10 19:45:21,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,390 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:45:21,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849634146] [2020-02-10 19:45:21,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:21,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054133599] [2020-02-10 19:45:21,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:21,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:21,392 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-02-10 19:45:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,461 INFO L93 Difference]: Finished difference Result 309 states and 761 transitions. [2020-02-10 19:45:21,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:21,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,463 INFO L225 Difference]: With dead ends: 309 [2020-02-10 19:45:21,463 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 19:45:21,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 19:45:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-02-10 19:45:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 550 transitions. [2020-02-10 19:45:21,467 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 550 transitions. Word has length 19 [2020-02-10 19:45:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,467 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 550 transitions. [2020-02-10 19:45:21,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 550 transitions. [2020-02-10 19:45:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:21,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:21,468 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1710392530, now seen corresponding path program 317 times [2020-02-10 19:45:21,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456758103] [2020-02-10 19:45:21,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,669 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:45:21,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456758103] [2020-02-10 19:45:21,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:21,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708084184] [2020-02-10 19:45:21,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:21,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:21,670 INFO L87 Difference]: Start difference. First operand 188 states and 550 transitions. Second operand 8 states. [2020-02-10 19:45:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,764 INFO L93 Difference]: Finished difference Result 301 states and 745 transitions. [2020-02-10 19:45:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:21,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,765 INFO L225 Difference]: With dead ends: 301 [2020-02-10 19:45:21,766 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 19:45:21,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 19:45:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 189. [2020-02-10 19:45:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 19:45:21,771 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 19:45:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,771 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 19:45:21,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 19:45:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:21,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:21,771 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1470750192, now seen corresponding path program 318 times [2020-02-10 19:45:21,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566141091] [2020-02-10 19:45:21,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,974 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:45:21,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566141091] [2020-02-10 19:45:21,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:21,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850714782] [2020-02-10 19:45:21,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:21,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:21,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:21,976 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 19:45:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,046 INFO L93 Difference]: Finished difference Result 301 states and 744 transitions. [2020-02-10 19:45:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:22,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,047 INFO L225 Difference]: With dead ends: 301 [2020-02-10 19:45:22,047 INFO L226 Difference]: Without dead ends: 288 [2020-02-10 19:45:22,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-02-10 19:45:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 186. [2020-02-10 19:45:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 546 transitions. [2020-02-10 19:45:22,051 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 546 transitions. Word has length 19 [2020-02-10 19:45:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,051 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 546 transitions. [2020-02-10 19:45:22,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 546 transitions. [2020-02-10 19:45:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:22,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:22,052 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash -445655956, now seen corresponding path program 319 times [2020-02-10 19:45:22,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069995493] [2020-02-10 19:45:22,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,229 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:45:22,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069995493] [2020-02-10 19:45:22,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:22,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807014260] [2020-02-10 19:45:22,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:22,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:22,230 INFO L87 Difference]: Start difference. First operand 186 states and 546 transitions. Second operand 8 states. [2020-02-10 19:45:22,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,287 INFO L93 Difference]: Finished difference Result 314 states and 773 transitions. [2020-02-10 19:45:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:22,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:22,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,288 INFO L225 Difference]: With dead ends: 314 [2020-02-10 19:45:22,288 INFO L226 Difference]: Without dead ends: 298 [2020-02-10 19:45:22,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-02-10 19:45:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 192. [2020-02-10 19:45:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-02-10 19:45:22,293 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-02-10 19:45:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,293 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-02-10 19:45:22,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-02-10 19:45:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:22,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:22,293 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1697584794, now seen corresponding path program 320 times [2020-02-10 19:45:22,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467938681] [2020-02-10 19:45:22,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,472 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:45:22,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467938681] [2020-02-10 19:45:22,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:22,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941938411] [2020-02-10 19:45:22,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:22,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:22,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:22,474 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-02-10 19:45:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,567 INFO L93 Difference]: Finished difference Result 308 states and 758 transitions. [2020-02-10 19:45:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:22,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,568 INFO L225 Difference]: With dead ends: 308 [2020-02-10 19:45:22,568 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 19:45:22,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 19:45:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-02-10 19:45:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-02-10 19:45:22,573 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-02-10 19:45:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,573 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-02-10 19:45:22,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-02-10 19:45:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:22,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:22,574 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -952002222, now seen corresponding path program 321 times [2020-02-10 19:45:22,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733098304] [2020-02-10 19:45:22,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,755 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:45:22,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733098304] [2020-02-10 19:45:22,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:22,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193715001] [2020-02-10 19:45:22,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:22,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:22,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:22,756 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-02-10 19:45:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,832 INFO L93 Difference]: Finished difference Result 320 states and 787 transitions. [2020-02-10 19:45:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:22,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,833 INFO L225 Difference]: With dead ends: 320 [2020-02-10 19:45:22,833 INFO L226 Difference]: Without dead ends: 304 [2020-02-10 19:45:22,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-02-10 19:45:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 195. [2020-02-10 19:45:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 19:45:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2020-02-10 19:45:22,838 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 19 [2020-02-10 19:45:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,839 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2020-02-10 19:45:22,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2020-02-10 19:45:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:22,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:22,839 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1928206972, now seen corresponding path program 322 times [2020-02-10 19:45:22,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987385536] [2020-02-10 19:45:22,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:23,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987385536] [2020-02-10 19:45:23,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:23,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967343470] [2020-02-10 19:45:23,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:23,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:23,024 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand 8 states. [2020-02-10 19:45:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,120 INFO L93 Difference]: Finished difference Result 317 states and 776 transitions. [2020-02-10 19:45:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:23,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,121 INFO L225 Difference]: With dead ends: 317 [2020-02-10 19:45:23,121 INFO L226 Difference]: Without dead ends: 298 [2020-02-10 19:45:23,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-02-10 19:45:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 189. [2020-02-10 19:45:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 19:45:23,125 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 19:45:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,125 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 19:45:23,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 19:45:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:23,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:23,126 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1813226296, now seen corresponding path program 323 times [2020-02-10 19:45:23,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075975529] [2020-02-10 19:45:23,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,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:45:23,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075975529] [2020-02-10 19:45:23,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:23,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030409439] [2020-02-10 19:45:23,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:23,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:23,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:23,303 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 19:45:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,390 INFO L93 Difference]: Finished difference Result 304 states and 748 transitions. [2020-02-10 19:45:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:23,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,392 INFO L225 Difference]: With dead ends: 304 [2020-02-10 19:45:23,392 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 19:45:23,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 19:45:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-02-10 19:45:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 553 transitions. [2020-02-10 19:45:23,398 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 553 transitions. Word has length 19 [2020-02-10 19:45:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,398 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 553 transitions. [2020-02-10 19:45:23,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 553 transitions. [2020-02-10 19:45:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:23,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:23,398 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 84178962, now seen corresponding path program 324 times [2020-02-10 19:45:23,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982947370] [2020-02-10 19:45:23,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,580 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:45:23,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982947370] [2020-02-10 19:45:23,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:23,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245348242] [2020-02-10 19:45:23,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:23,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:23,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:23,581 INFO L87 Difference]: Start difference. First operand 191 states and 553 transitions. Second operand 8 states. [2020-02-10 19:45:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,669 INFO L93 Difference]: Finished difference Result 307 states and 753 transitions. [2020-02-10 19:45:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:23,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,670 INFO L225 Difference]: With dead ends: 307 [2020-02-10 19:45:23,671 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 19:45:23,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 19:45:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 186. [2020-02-10 19:45:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-02-10 19:45:23,675 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-02-10 19:45:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,676 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-02-10 19:45:23,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-02-10 19:45:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:23,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:23,676 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,677 INFO L82 PathProgramCache]: Analyzing trace with hash -120059732, now seen corresponding path program 325 times [2020-02-10 19:45:23,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159529371] [2020-02-10 19:45:23,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,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:45:23,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159529371] [2020-02-10 19:45:23,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:23,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798329794] [2020-02-10 19:45:23,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:23,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:23,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:23,870 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-02-10 19:45:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,930 INFO L93 Difference]: Finished difference Result 311 states and 761 transitions. [2020-02-10 19:45:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:23,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,932 INFO L225 Difference]: With dead ends: 311 [2020-02-10 19:45:23,932 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 19:45:23,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 19:45:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 192. [2020-02-10 19:45:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-02-10 19:45:23,937 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-02-10 19:45:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,937 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-02-10 19:45:23,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-02-10 19:45:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:23,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:23,938 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash 138998494, now seen corresponding path program 326 times [2020-02-10 19:45:23,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834395609] [2020-02-10 19:45:23,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,148 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:45:24,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834395609] [2020-02-10 19:45:24,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:24,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127288526] [2020-02-10 19:45:24,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:24,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:24,150 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-02-10 19:45:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,223 INFO L93 Difference]: Finished difference Result 305 states and 746 transitions. [2020-02-10 19:45:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:24,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,225 INFO L225 Difference]: With dead ends: 305 [2020-02-10 19:45:24,225 INFO L226 Difference]: Without dead ends: 292 [2020-02-10 19:45:24,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-02-10 19:45:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 189. [2020-02-10 19:45:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 19:45:24,230 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 19:45:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,230 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 19:45:24,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 19:45:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:24,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,231 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash 974031856, now seen corresponding path program 327 times [2020-02-10 19:45:24,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348830111] [2020-02-10 19:45:24,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,428 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:45:24,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348830111] [2020-02-10 19:45:24,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:24,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677491297] [2020-02-10 19:45:24,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:24,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:24,429 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 19:45:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,502 INFO L93 Difference]: Finished difference Result 311 states and 758 transitions. [2020-02-10 19:45:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:24,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,504 INFO L225 Difference]: With dead ends: 311 [2020-02-10 19:45:24,504 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 19:45:24,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 19:45:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2020-02-10 19:45:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-02-10 19:45:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 562 transitions. [2020-02-10 19:45:24,509 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 562 transitions. Word has length 19 [2020-02-10 19:45:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,509 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 562 transitions. [2020-02-10 19:45:24,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 562 transitions. [2020-02-10 19:45:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:24,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,510 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2172894, now seen corresponding path program 328 times [2020-02-10 19:45:24,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292389746] [2020-02-10 19:45:24,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,701 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:45:24,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292389746] [2020-02-10 19:45:24,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:24,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450282331] [2020-02-10 19:45:24,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:24,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:24,702 INFO L87 Difference]: Start difference. First operand 195 states and 562 transitions. Second operand 8 states. [2020-02-10 19:45:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,791 INFO L93 Difference]: Finished difference Result 308 states and 747 transitions. [2020-02-10 19:45:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:24,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,793 INFO L225 Difference]: With dead ends: 308 [2020-02-10 19:45:24,793 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 19:45:24,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 19:45:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 189. [2020-02-10 19:45:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-02-10 19:45:24,798 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-02-10 19:45:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,798 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-02-10 19:45:24,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-02-10 19:45:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:24,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,798 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1309572854, now seen corresponding path program 329 times [2020-02-10 19:45:24,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208936885] [2020-02-10 19:45:24,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,984 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:45:24,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208936885] [2020-02-10 19:45:24,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:24,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841345495] [2020-02-10 19:45:24,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:24,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:24,986 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-02-10 19:45:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,059 INFO L93 Difference]: Finished difference Result 295 states and 719 transitions. [2020-02-10 19:45:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:25,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,060 INFO L225 Difference]: With dead ends: 295 [2020-02-10 19:45:25,060 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 19:45:25,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 19:45:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 191. [2020-02-10 19:45:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-02-10 19:45:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 551 transitions. [2020-02-10 19:45:25,065 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 551 transitions. Word has length 19 [2020-02-10 19:45:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,065 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 551 transitions. [2020-02-10 19:45:25,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 551 transitions. [2020-02-10 19:45:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:25,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:25,066 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash 179832142, now seen corresponding path program 330 times [2020-02-10 19:45:25,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772334700] [2020-02-10 19:45:25,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,259 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:45:25,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772334700] [2020-02-10 19:45:25,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:25,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046135735] [2020-02-10 19:45:25,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:25,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:25,261 INFO L87 Difference]: Start difference. First operand 191 states and 551 transitions. Second operand 8 states. [2020-02-10 19:45:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,344 INFO L93 Difference]: Finished difference Result 293 states and 714 transitions. [2020-02-10 19:45:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:25,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,345 INFO L225 Difference]: With dead ends: 293 [2020-02-10 19:45:25,345 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 19:45:25,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 19:45:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2020-02-10 19:45:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 542 transitions. [2020-02-10 19:45:25,350 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 542 transitions. Word has length 19 [2020-02-10 19:45:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,350 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 542 transitions. [2020-02-10 19:45:25,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 542 transitions. [2020-02-10 19:45:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:25,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:25,351 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash -245646298, now seen corresponding path program 331 times [2020-02-10 19:45:25,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685059774] [2020-02-10 19:45:25,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,546 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:45:25,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685059774] [2020-02-10 19:45:25,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:25,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786382455] [2020-02-10 19:45:25,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:25,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:25,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:25,547 INFO L87 Difference]: Start difference. First operand 186 states and 542 transitions. Second operand 8 states. [2020-02-10 19:45:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,634 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-02-10 19:45:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:25,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,635 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:25,635 INFO L226 Difference]: Without dead ends: 273 [2020-02-10 19:45:25,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-02-10 19:45:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2020-02-10 19:45:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 546 transitions. [2020-02-10 19:45:25,639 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 546 transitions. Word has length 19 [2020-02-10 19:45:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,639 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 546 transitions. [2020-02-10 19:45:25,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 546 transitions. [2020-02-10 19:45:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:25,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:25,640 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:25,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash -485288636, now seen corresponding path program 332 times [2020-02-10 19:45:25,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696135091] [2020-02-10 19:45:25,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,847 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:45:25,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696135091] [2020-02-10 19:45:25,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:25,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113739145] [2020-02-10 19:45:25,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:25,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:25,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:25,848 INFO L87 Difference]: Start difference. First operand 188 states and 546 transitions. Second operand 8 states. [2020-02-10 19:45:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,911 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-02-10 19:45:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:25,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,912 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:25,912 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 19:45:25,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 19:45:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2020-02-10 19:45:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 19:45:25,916 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 19:45:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,916 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 19:45:25,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 19:45:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:25,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:25,917 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1318731678, now seen corresponding path program 333 times [2020-02-10 19:45:25,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416298328] [2020-02-10 19:45:25,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,108 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:45:26,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416298328] [2020-02-10 19:45:26,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:26,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123570889] [2020-02-10 19:45:26,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:26,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:26,109 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 19:45:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,194 INFO L93 Difference]: Finished difference Result 280 states and 688 transitions. [2020-02-10 19:45:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:26,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,195 INFO L225 Difference]: With dead ends: 280 [2020-02-10 19:45:26,195 INFO L226 Difference]: Without dead ends: 270 [2020-02-10 19:45:26,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-02-10 19:45:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 189. [2020-02-10 19:45:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-02-10 19:45:26,200 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-02-10 19:45:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,200 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-02-10 19:45:26,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-02-10 19:45:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:26,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:26,201 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash -363752674, now seen corresponding path program 334 times [2020-02-10 19:45:26,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563529405] [2020-02-10 19:45:26,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,391 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:45:26,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563529405] [2020-02-10 19:45:26,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:26,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823874549] [2020-02-10 19:45:26,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:26,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:26,393 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-02-10 19:45:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,473 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-02-10 19:45:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:26,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,475 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:26,475 INFO L226 Difference]: Without dead ends: 268 [2020-02-10 19:45:26,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-02-10 19:45:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 187. [2020-02-10 19:45:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 19:45:26,480 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 19:45:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,480 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 19:45:26,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 19:45:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:26,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:26,480 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash 52566942, now seen corresponding path program 335 times [2020-02-10 19:45:26,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239056449] [2020-02-10 19:45:26,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:26,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239056449] [2020-02-10 19:45:26,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:26,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768607694] [2020-02-10 19:45:26,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:26,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:26,673 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 19:45:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,749 INFO L93 Difference]: Finished difference Result 278 states and 682 transitions. [2020-02-10 19:45:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:26,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,750 INFO L225 Difference]: With dead ends: 278 [2020-02-10 19:45:26,751 INFO L226 Difference]: Without dead ends: 268 [2020-02-10 19:45:26,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-02-10 19:45:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 189. [2020-02-10 19:45:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-02-10 19:45:26,755 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-02-10 19:45:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,756 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-02-10 19:45:26,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-02-10 19:45:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:26,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:26,756 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1541971938, now seen corresponding path program 336 times [2020-02-10 19:45:26,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969195187] [2020-02-10 19:45:26,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,946 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:45:26,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969195187] [2020-02-10 19:45:26,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:26,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033442655] [2020-02-10 19:45:26,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:26,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:26,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:26,947 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-02-10 19:45:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,029 INFO L93 Difference]: Finished difference Result 276 states and 677 transitions. [2020-02-10 19:45:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:27,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,030 INFO L225 Difference]: With dead ends: 276 [2020-02-10 19:45:27,031 INFO L226 Difference]: Without dead ends: 258 [2020-02-10 19:45:27,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-02-10 19:45:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 184. [2020-02-10 19:45:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-02-10 19:45:27,036 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-02-10 19:45:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,036 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-02-10 19:45:27,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-02-10 19:45:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:27,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,036 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:27,036 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1064346626, now seen corresponding path program 337 times [2020-02-10 19:45:27,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404811506] [2020-02-10 19:45:27,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,221 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:45:27,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404811506] [2020-02-10 19:45:27,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:27,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140078191] [2020-02-10 19:45:27,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:27,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:27,223 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-02-10 19:45:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,317 INFO L93 Difference]: Finished difference Result 296 states and 736 transitions. [2020-02-10 19:45:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:27,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,318 INFO L225 Difference]: With dead ends: 296 [2020-02-10 19:45:27,318 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 19:45:27,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 19:45:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-02-10 19:45:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-02-10 19:45:27,323 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-02-10 19:45:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,324 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-02-10 19:45:27,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-02-10 19:45:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:27,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:27,324 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash 190011300, now seen corresponding path program 338 times [2020-02-10 19:45:27,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651451525] [2020-02-10 19:45:27,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,525 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:45:27,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651451525] [2020-02-10 19:45:27,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:27,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173500169] [2020-02-10 19:45:27,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:27,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:27,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:27,527 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-02-10 19:45:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,612 INFO L93 Difference]: Finished difference Result 292 states and 725 transitions. [2020-02-10 19:45:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:27,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,613 INFO L225 Difference]: With dead ends: 292 [2020-02-10 19:45:27,613 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 19:45:27,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 19:45:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-02-10 19:45:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-02-10 19:45:27,618 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-02-10 19:45:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,618 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-02-10 19:45:27,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-02-10 19:45:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:27,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:27,619 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2069598556, now seen corresponding path program 339 times [2020-02-10 19:45:27,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818338183] [2020-02-10 19:45:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,805 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:45:27,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818338183] [2020-02-10 19:45:27,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:27,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627307156] [2020-02-10 19:45:27,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:27,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:27,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:27,806 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-02-10 19:45:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,884 INFO L93 Difference]: Finished difference Result 296 states and 735 transitions. [2020-02-10 19:45:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:27,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,885 INFO L225 Difference]: With dead ends: 296 [2020-02-10 19:45:27,885 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 19:45:27,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 19:45:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-02-10 19:45:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-02-10 19:45:27,889 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-02-10 19:45:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,890 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-02-10 19:45:27,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-02-10 19:45:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:27,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:27,890 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash -949468726, now seen corresponding path program 340 times [2020-02-10 19:45:27,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939108200] [2020-02-10 19:45:27,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,081 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:45:28,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939108200] [2020-02-10 19:45:28,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:28,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445955850] [2020-02-10 19:45:28,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:28,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:28,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:28,083 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-02-10 19:45:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,149 INFO L93 Difference]: Finished difference Result 292 states and 724 transitions. [2020-02-10 19:45:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:28,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,150 INFO L225 Difference]: With dead ends: 292 [2020-02-10 19:45:28,150 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 19:45:28,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 19:45:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-02-10 19:45:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 543 transitions. [2020-02-10 19:45:28,154 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 543 transitions. Word has length 19 [2020-02-10 19:45:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,154 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 543 transitions. [2020-02-10 19:45:28,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 543 transitions. [2020-02-10 19:45:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:28,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:28,155 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash -171970810, now seen corresponding path program 341 times [2020-02-10 19:45:28,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884635762] [2020-02-10 19:45:28,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,359 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:45:28,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884635762] [2020-02-10 19:45:28,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:28,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194295131] [2020-02-10 19:45:28,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:28,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:28,361 INFO L87 Difference]: Start difference. First operand 186 states and 543 transitions. Second operand 8 states. [2020-02-10 19:45:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,451 INFO L93 Difference]: Finished difference Result 287 states and 713 transitions. [2020-02-10 19:45:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:28,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,452 INFO L225 Difference]: With dead ends: 287 [2020-02-10 19:45:28,452 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 19:45:28,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 19:45:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-02-10 19:45:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 19:45:28,456 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 19:45:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,457 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 19:45:28,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 19:45:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:28,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:28,457 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash -411613148, now seen corresponding path program 342 times [2020-02-10 19:45:28,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894981800] [2020-02-10 19:45:28,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,661 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:45:28,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894981800] [2020-02-10 19:45:28,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:28,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638816321] [2020-02-10 19:45:28,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:28,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:28,663 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 19:45:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,733 INFO L93 Difference]: Finished difference Result 287 states and 712 transitions. [2020-02-10 19:45:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:28,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,734 INFO L225 Difference]: With dead ends: 287 [2020-02-10 19:45:28,734 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 19:45:28,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 19:45:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2020-02-10 19:45:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 19:45:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 541 transitions. [2020-02-10 19:45:28,739 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 541 transitions. Word has length 19 [2020-02-10 19:45:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,739 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 541 transitions. [2020-02-10 19:45:28,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 541 transitions. [2020-02-10 19:45:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:28,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:28,740 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:28,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2136529082, now seen corresponding path program 343 times [2020-02-10 19:45:28,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270895712] [2020-02-10 19:45:28,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,910 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:45:28,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270895712] [2020-02-10 19:45:28,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:28,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131290871] [2020-02-10 19:45:28,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:28,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:28,911 INFO L87 Difference]: Start difference. First operand 185 states and 541 transitions. Second operand 8 states. [2020-02-10 19:45:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,989 INFO L93 Difference]: Finished difference Result 297 states and 737 transitions. [2020-02-10 19:45:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:28,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,991 INFO L225 Difference]: With dead ends: 297 [2020-02-10 19:45:28,991 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 19:45:28,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 19:45:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 189. [2020-02-10 19:45:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-02-10 19:45:28,995 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-02-10 19:45:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,995 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-02-10 19:45:28,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-02-10 19:45:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:28,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:28,996 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1284102888, now seen corresponding path program 344 times [2020-02-10 19:45:28,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679027335] [2020-02-10 19:45:28,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,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:45:29,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679027335] [2020-02-10 19:45:29,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:29,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140052997] [2020-02-10 19:45:29,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:29,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:29,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:29,167 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-02-10 19:45:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,252 INFO L93 Difference]: Finished difference Result 293 states and 726 transitions. [2020-02-10 19:45:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:29,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,253 INFO L225 Difference]: With dead ends: 293 [2020-02-10 19:45:29,253 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 19:45:29,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 19:45:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 187. [2020-02-10 19:45:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-02-10 19:45:29,258 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-02-10 19:45:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,258 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-02-10 19:45:29,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-02-10 19:45:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:29,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:29,259 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1698016266, now seen corresponding path program 345 times [2020-02-10 19:45:29,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267104075] [2020-02-10 19:45:29,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,436 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:45:29,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267104075] [2020-02-10 19:45:29,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:29,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132214750] [2020-02-10 19:45:29,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:29,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:29,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:29,437 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-02-10 19:45:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,528 INFO L93 Difference]: Finished difference Result 303 states and 752 transitions. [2020-02-10 19:45:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:29,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,529 INFO L225 Difference]: With dead ends: 303 [2020-02-10 19:45:29,529 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 19:45:29,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 19:45:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2020-02-10 19:45:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 19:45:29,533 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 19:45:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,534 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 19:45:29,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 19:45:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:29,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:29,534 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:29,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066990, now seen corresponding path program 346 times [2020-02-10 19:45:29,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627888846] [2020-02-10 19:45:29,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:29,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627888846] [2020-02-10 19:45:29,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:29,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961003282] [2020-02-10 19:45:29,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:29,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:29,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:29,716 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 19:45:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,798 INFO L93 Difference]: Finished difference Result 302 states and 745 transitions. [2020-02-10 19:45:29,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:29,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,799 INFO L225 Difference]: With dead ends: 302 [2020-02-10 19:45:29,799 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 19:45:29,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 19:45:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 187. [2020-02-10 19:45:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-02-10 19:45:29,803 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-02-10 19:45:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,803 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-02-10 19:45:29,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-02-10 19:45:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:29,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:29,804 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1237178862, now seen corresponding path program 347 times [2020-02-10 19:45:29,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349365183] [2020-02-10 19:45:29,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:29,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349365183] [2020-02-10 19:45:29,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:29,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027030681] [2020-02-10 19:45:29,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:29,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:29,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:29,979 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-02-10 19:45:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,054 INFO L93 Difference]: Finished difference Result 292 states and 722 transitions. [2020-02-10 19:45:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:30,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,056 INFO L225 Difference]: With dead ends: 292 [2020-02-10 19:45:30,056 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 19:45:30,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 19:45:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 189. [2020-02-10 19:45:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-02-10 19:45:30,061 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-02-10 19:45:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,061 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-02-10 19:45:30,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-02-10 19:45:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:30,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:30,062 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1328741100, now seen corresponding path program 348 times [2020-02-10 19:45:30,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656534310] [2020-02-10 19:45:30,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:30,238 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:45:30,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656534310] [2020-02-10 19:45:30,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:30,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:30,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299201167] [2020-02-10 19:45:30,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:30,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:30,240 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-02-10 19:45:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,333 INFO L93 Difference]: Finished difference Result 295 states and 727 transitions. [2020-02-10 19:45:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:30,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,334 INFO L225 Difference]: With dead ends: 295 [2020-02-10 19:45:30,334 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 19:45:30,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 19:45:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 185. [2020-02-10 19:45:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 19:45:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 540 transitions. [2020-02-10 19:45:30,340 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 540 transitions. Word has length 19 [2020-02-10 19:45:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,340 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 540 transitions. [2020-02-10 19:45:30,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 540 transitions. [2020-02-10 19:45:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:30,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,340 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:30,341 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:30,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1719022474, now seen corresponding path program 349 times [2020-02-10 19:45:30,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218782951] [2020-02-10 19:45:30,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:30,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218782951] [2020-02-10 19:45:30,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:30,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:30,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215222425] [2020-02-10 19:45:30,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:30,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:30,529 INFO L87 Difference]: Start difference. First operand 185 states and 540 transitions. Second operand 8 states. [2020-02-10 19:45:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,613 INFO L93 Difference]: Finished difference Result 295 states and 729 transitions. [2020-02-10 19:45:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:30,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,614 INFO L225 Difference]: With dead ends: 295 [2020-02-10 19:45:30,614 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 19:45:30,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 19:45:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2020-02-10 19:45:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-02-10 19:45:30,620 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-02-10 19:45:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,620 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-02-10 19:45:30,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-02-10 19:45:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:30,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:30,620 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1455814992, now seen corresponding path program 350 times [2020-02-10 19:45:30,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277088073] [2020-02-10 19:45:30,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:30,819 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:45:30,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277088073] [2020-02-10 19:45:30,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:30,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:30,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866760513] [2020-02-10 19:45:30,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:30,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:30,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:30,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:30,821 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-02-10 19:45:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,886 INFO L93 Difference]: Finished difference Result 291 states and 718 transitions. [2020-02-10 19:45:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:30,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,887 INFO L225 Difference]: With dead ends: 291 [2020-02-10 19:45:30,887 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 19:45:30,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 19:45:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 187. [2020-02-10 19:45:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 545 transitions. [2020-02-10 19:45:30,892 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 545 transitions. Word has length 19 [2020-02-10 19:45:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,893 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 545 transitions. [2020-02-10 19:45:30,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 545 transitions. [2020-02-10 19:45:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:30,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:30,893 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 645937094, now seen corresponding path program 351 times [2020-02-10 19:45:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011316446] [2020-02-10 19:45:30,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:31,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011316446] [2020-02-10 19:45:31,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:31,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288913980] [2020-02-10 19:45:31,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:31,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:31,085 INFO L87 Difference]: Start difference. First operand 187 states and 545 transitions. Second operand 8 states. [2020-02-10 19:45:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,174 INFO L93 Difference]: Finished difference Result 296 states and 729 transitions. [2020-02-10 19:45:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:31,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,175 INFO L225 Difference]: With dead ends: 296 [2020-02-10 19:45:31,175 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 19:45:31,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 19:45:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 192. [2020-02-10 19:45:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2020-02-10 19:45:31,179 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 19 [2020-02-10 19:45:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,180 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2020-02-10 19:45:31,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2020-02-10 19:45:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:31,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:31,180 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash 3880176, now seen corresponding path program 352 times [2020-02-10 19:45:31,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081771221] [2020-02-10 19:45:31,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,367 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:45:31,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081771221] [2020-02-10 19:45:31,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:31,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954194044] [2020-02-10 19:45:31,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:31,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:31,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:31,369 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand 8 states. [2020-02-10 19:45:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,451 INFO L93 Difference]: Finished difference Result 295 states and 722 transitions. [2020-02-10 19:45:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:31,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,452 INFO L225 Difference]: With dead ends: 295 [2020-02-10 19:45:31,452 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 19:45:31,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 19:45:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-02-10 19:45:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 19:45:31,458 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 19:45:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,458 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 19:45:31,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 19:45:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:31,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:31,459 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,459 INFO L82 PathProgramCache]: Analyzing trace with hash -380103836, now seen corresponding path program 353 times [2020-02-10 19:45:31,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934320075] [2020-02-10 19:45:31,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,647 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:45:31,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934320075] [2020-02-10 19:45:31,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:31,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265193596] [2020-02-10 19:45:31,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:31,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:31,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:31,649 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 19:45:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,705 INFO L93 Difference]: Finished difference Result 285 states and 699 transitions. [2020-02-10 19:45:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:31,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,706 INFO L225 Difference]: With dead ends: 285 [2020-02-10 19:45:31,706 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 19:45:31,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 19:45:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-02-10 19:45:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-02-10 19:45:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-02-10 19:45:31,711 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-02-10 19:45:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,711 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-02-10 19:45:31,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-02-10 19:45:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:31,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:31,711 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1109301160, now seen corresponding path program 354 times [2020-02-10 19:45:31,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932584914] [2020-02-10 19:45:31,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,898 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:45:31,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932584914] [2020-02-10 19:45:31,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:31,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797832699] [2020-02-10 19:45:31,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:31,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:31,900 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-02-10 19:45:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,979 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-02-10 19:45:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:31,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,981 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:31,981 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 19:45:31,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 19:45:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2020-02-10 19:45:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 19:45:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 539 transitions. [2020-02-10 19:45:31,986 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 539 transitions. Word has length 19 [2020-02-10 19:45:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,986 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 539 transitions. [2020-02-10 19:45:31,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 539 transitions. [2020-02-10 19:45:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:31,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:31,987 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1184663342, now seen corresponding path program 355 times [2020-02-10 19:45:31,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464823193] [2020-02-10 19:45:31,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,196 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:45:32,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464823193] [2020-02-10 19:45:32,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:32,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614048702] [2020-02-10 19:45:32,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:32,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:32,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:32,197 INFO L87 Difference]: Start difference. First operand 185 states and 539 transitions. Second operand 8 states. [2020-02-10 19:45:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,285 INFO L93 Difference]: Finished difference Result 277 states and 681 transitions. [2020-02-10 19:45:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:32,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,287 INFO L225 Difference]: With dead ends: 277 [2020-02-10 19:45:32,287 INFO L226 Difference]: Without dead ends: 267 [2020-02-10 19:45:32,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-02-10 19:45:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 187. [2020-02-10 19:45:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-02-10 19:45:32,292 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-02-10 19:45:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,292 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-02-10 19:45:32,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-02-10 19:45:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:32,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:32,292 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1424305680, now seen corresponding path program 356 times [2020-02-10 19:45:32,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336279391] [2020-02-10 19:45:32,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,493 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:45:32,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336279391] [2020-02-10 19:45:32,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:32,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430995919] [2020-02-10 19:45:32,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:32,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:32,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:32,495 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-02-10 19:45:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,557 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-02-10 19:45:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:32,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,559 INFO L225 Difference]: With dead ends: 277 [2020-02-10 19:45:32,559 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 19:45:32,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 19:45:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 186. [2020-02-10 19:45:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 541 transitions. [2020-02-10 19:45:32,563 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 541 transitions. Word has length 19 [2020-02-10 19:45:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,563 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 541 transitions. [2020-02-10 19:45:32,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 541 transitions. [2020-02-10 19:45:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:32,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:32,563 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2037218574, now seen corresponding path program 357 times [2020-02-10 19:45:32,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22463541] [2020-02-10 19:45:32,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,749 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:45:32,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22463541] [2020-02-10 19:45:32,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:32,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851303019] [2020-02-10 19:45:32,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:32,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:32,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:32,750 INFO L87 Difference]: Start difference. First operand 186 states and 541 transitions. Second operand 8 states. [2020-02-10 19:45:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,834 INFO L93 Difference]: Finished difference Result 274 states and 675 transitions. [2020-02-10 19:45:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:32,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,836 INFO L225 Difference]: With dead ends: 274 [2020-02-10 19:45:32,836 INFO L226 Difference]: Without dead ends: 264 [2020-02-10 19:45:32,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-02-10 19:45:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 188. [2020-02-10 19:45:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 544 transitions. [2020-02-10 19:45:32,841 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 544 transitions. Word has length 19 [2020-02-10 19:45:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,841 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 544 transitions. [2020-02-10 19:45:32,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 544 transitions. [2020-02-10 19:45:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:32,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:32,842 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:32,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1302769718, now seen corresponding path program 358 times [2020-02-10 19:45:32,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502698581] [2020-02-10 19:45:32,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,037 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:45:33,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502698581] [2020-02-10 19:45:33,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:33,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110395308] [2020-02-10 19:45:33,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:33,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:33,038 INFO L87 Difference]: Start difference. First operand 188 states and 544 transitions. Second operand 8 states. [2020-02-10 19:45:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,124 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-02-10 19:45:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:33,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,125 INFO L225 Difference]: With dead ends: 277 [2020-02-10 19:45:33,126 INFO L226 Difference]: Without dead ends: 262 [2020-02-10 19:45:33,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-02-10 19:45:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 186. [2020-02-10 19:45:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 540 transitions. [2020-02-10 19:45:33,130 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 540 transitions. Word has length 19 [2020-02-10 19:45:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,130 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 540 transitions. [2020-02-10 19:45:33,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 540 transitions. [2020-02-10 19:45:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:33,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:33,131 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash -886450102, now seen corresponding path program 359 times [2020-02-10 19:45:33,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173772224] [2020-02-10 19:45:33,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,331 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:45:33,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173772224] [2020-02-10 19:45:33,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:33,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487083423] [2020-02-10 19:45:33,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:33,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:33,332 INFO L87 Difference]: Start difference. First operand 186 states and 540 transitions. Second operand 8 states. [2020-02-10 19:45:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,405 INFO L93 Difference]: Finished difference Result 272 states and 669 transitions. [2020-02-10 19:45:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:33,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,407 INFO L225 Difference]: With dead ends: 272 [2020-02-10 19:45:33,407 INFO L226 Difference]: Without dead ends: 262 [2020-02-10 19:45:33,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-02-10 19:45:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 188. [2020-02-10 19:45:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-02-10 19:45:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 543 transitions. [2020-02-10 19:45:33,412 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 543 transitions. Word has length 19 [2020-02-10 19:45:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,412 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 543 transitions. [2020-02-10 19:45:33,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 543 transitions. [2020-02-10 19:45:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:33,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:33,413 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:33,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash 602954894, now seen corresponding path program 360 times [2020-02-10 19:45:33,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389095757] [2020-02-10 19:45:33,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:33,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389095757] [2020-02-10 19:45:33,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:33,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781553200] [2020-02-10 19:45:33,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:33,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:33,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:33,603 INFO L87 Difference]: Start difference. First operand 188 states and 543 transitions. Second operand 8 states. [2020-02-10 19:45:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,684 INFO L93 Difference]: Finished difference Result 270 states and 664 transitions. [2020-02-10 19:45:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:33,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,685 INFO L225 Difference]: With dead ends: 270 [2020-02-10 19:45:33,685 INFO L226 Difference]: Without dead ends: 249 [2020-02-10 19:45:33,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-02-10 19:45:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2020-02-10 19:45:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 19:45:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 530 transitions. [2020-02-10 19:45:33,690 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 530 transitions. Word has length 19 [2020-02-10 19:45:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,690 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 530 transitions. [2020-02-10 19:45:33,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 530 transitions. [2020-02-10 19:45:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:33,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:33,691 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash 234329704, now seen corresponding path program 361 times [2020-02-10 19:45:33,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055319564] [2020-02-10 19:45:33,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,899 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:45:33,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055319564] [2020-02-10 19:45:33,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:33,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785464674] [2020-02-10 19:45:33,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:33,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:33,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:33,901 INFO L87 Difference]: Start difference. First operand 180 states and 530 transitions. Second operand 8 states. [2020-02-10 19:45:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,962 INFO L93 Difference]: Finished difference Result 319 states and 780 transitions. [2020-02-10 19:45:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:33,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,963 INFO L225 Difference]: With dead ends: 319 [2020-02-10 19:45:33,963 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 19:45:33,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 19:45:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-02-10 19:45:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-02-10 19:45:33,968 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-02-10 19:45:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,968 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-02-10 19:45:33,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-02-10 19:45:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:33,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:33,969 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash 608980890, now seen corresponding path program 362 times [2020-02-10 19:45:33,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855106874] [2020-02-10 19:45:33,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,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:45:34,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855106874] [2020-02-10 19:45:34,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:34,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201368591] [2020-02-10 19:45:34,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:34,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:34,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:34,177 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-02-10 19:45:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,260 INFO L93 Difference]: Finished difference Result 317 states and 770 transitions. [2020-02-10 19:45:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:34,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,261 INFO L225 Difference]: With dead ends: 317 [2020-02-10 19:45:34,262 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 19:45:34,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 19:45:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 19:45:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-02-10 19:45:34,267 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-02-10 19:45:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,267 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-02-10 19:45:34,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-02-10 19:45:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:34,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:34,267 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:34,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash 438930786, now seen corresponding path program 363 times [2020-02-10 19:45:34,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976339659] [2020-02-10 19:45:34,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,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:45:34,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976339659] [2020-02-10 19:45:34,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:34,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491290120] [2020-02-10 19:45:34,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:34,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:34,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:34,468 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-02-10 19:45:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,525 INFO L93 Difference]: Finished difference Result 310 states and 753 transitions. [2020-02-10 19:45:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:34,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,526 INFO L225 Difference]: With dead ends: 310 [2020-02-10 19:45:34,526 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 19:45:34,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 19:45:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-02-10 19:45:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 542 transitions. [2020-02-10 19:45:34,532 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 542 transitions. Word has length 19 [2020-02-10 19:45:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,532 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 542 transitions. [2020-02-10 19:45:34,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 542 transitions. [2020-02-10 19:45:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:34,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:34,533 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1712795760, now seen corresponding path program 364 times [2020-02-10 19:45:34,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128904645] [2020-02-10 19:45:34,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,731 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:45:34,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128904645] [2020-02-10 19:45:34,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:34,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011350465] [2020-02-10 19:45:34,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:34,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:34,733 INFO L87 Difference]: Start difference. First operand 187 states and 542 transitions. Second operand 8 states. [2020-02-10 19:45:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,813 INFO L93 Difference]: Finished difference Result 304 states and 738 transitions. [2020-02-10 19:45:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:34,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,814 INFO L225 Difference]: With dead ends: 304 [2020-02-10 19:45:34,814 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 19:45:34,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 19:45:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-02-10 19:45:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-02-10 19:45:34,819 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-02-10 19:45:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,819 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-02-10 19:45:34,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-02-10 19:45:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:34,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:34,819 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash -959085248, now seen corresponding path program 365 times [2020-02-10 19:45:34,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291840192] [2020-02-10 19:45:34,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,017 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:45:35,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291840192] [2020-02-10 19:45:35,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:35,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447750737] [2020-02-10 19:45:35,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:35,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:35,018 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-02-10 19:45:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,094 INFO L93 Difference]: Finished difference Result 305 states and 742 transitions. [2020-02-10 19:45:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:35,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,095 INFO L225 Difference]: With dead ends: 305 [2020-02-10 19:45:35,096 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 19:45:35,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 19:45:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-02-10 19:45:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 538 transitions. [2020-02-10 19:45:35,101 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 538 transitions. Word has length 19 [2020-02-10 19:45:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,101 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 538 transitions. [2020-02-10 19:45:35,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 538 transitions. [2020-02-10 19:45:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:35,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:35,101 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1833420574, now seen corresponding path program 366 times [2020-02-10 19:45:35,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899070132] [2020-02-10 19:45:35,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,300 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:45:35,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899070132] [2020-02-10 19:45:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:35,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765243841] [2020-02-10 19:45:35,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:35,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:35,301 INFO L87 Difference]: Start difference. First operand 186 states and 538 transitions. Second operand 8 states. [2020-02-10 19:45:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,384 INFO L93 Difference]: Finished difference Result 301 states and 731 transitions. [2020-02-10 19:45:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:35,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,385 INFO L225 Difference]: With dead ends: 301 [2020-02-10 19:45:35,385 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 19:45:35,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 19:45:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-02-10 19:45:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 19:45:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 527 transitions. [2020-02-10 19:45:35,390 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 527 transitions. Word has length 19 [2020-02-10 19:45:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,390 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 527 transitions. [2020-02-10 19:45:35,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 527 transitions. [2020-02-10 19:45:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:35,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:35,391 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash -188156022, now seen corresponding path program 367 times [2020-02-10 19:45:35,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235389434] [2020-02-10 19:45:35,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:35,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235389434] [2020-02-10 19:45:35,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:35,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542654788] [2020-02-10 19:45:35,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:35,604 INFO L87 Difference]: Start difference. First operand 180 states and 527 transitions. Second operand 8 states. [2020-02-10 19:45:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,669 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-02-10 19:45:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:35,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,671 INFO L225 Difference]: With dead ends: 319 [2020-02-10 19:45:35,671 INFO L226 Difference]: Without dead ends: 303 [2020-02-10 19:45:35,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-02-10 19:45:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-02-10 19:45:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-02-10 19:45:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 553 transitions. [2020-02-10 19:45:35,675 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 553 transitions. Word has length 19 [2020-02-10 19:45:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,676 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 553 transitions. [2020-02-10 19:45:35,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 553 transitions. [2020-02-10 19:45:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:35,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:35,676 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 186495164, now seen corresponding path program 368 times [2020-02-10 19:45:35,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991001273] [2020-02-10 19:45:35,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,883 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:45:35,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991001273] [2020-02-10 19:45:35,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:35,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307900408] [2020-02-10 19:45:35,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:35,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:35,884 INFO L87 Difference]: Start difference. First operand 192 states and 553 transitions. Second operand 8 states. [2020-02-10 19:45:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,957 INFO L93 Difference]: Finished difference Result 317 states and 767 transitions. [2020-02-10 19:45:35,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:35,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,958 INFO L225 Difference]: With dead ends: 317 [2020-02-10 19:45:35,958 INFO L226 Difference]: Without dead ends: 295 [2020-02-10 19:45:35,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-02-10 19:45:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-02-10 19:45:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-02-10 19:45:35,964 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-02-10 19:45:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,964 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-02-10 19:45:35,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-02-10 19:45:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:35,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:35,964 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash 342041284, now seen corresponding path program 369 times [2020-02-10 19:45:35,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851135836] [2020-02-10 19:45:35,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,197 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:45:36,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851135836] [2020-02-10 19:45:36,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:36,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644003680] [2020-02-10 19:45:36,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:36,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:36,198 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-02-10 19:45:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,265 INFO L93 Difference]: Finished difference Result 310 states and 750 transitions. [2020-02-10 19:45:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:36,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,266 INFO L225 Difference]: With dead ends: 310 [2020-02-10 19:45:36,266 INFO L226 Difference]: Without dead ends: 294 [2020-02-10 19:45:36,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-02-10 19:45:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-02-10 19:45:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 539 transitions. [2020-02-10 19:45:36,271 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 539 transitions. Word has length 19 [2020-02-10 19:45:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,271 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 539 transitions. [2020-02-10 19:45:36,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 539 transitions. [2020-02-10 19:45:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:36,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:36,272 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,272 INFO L82 PathProgramCache]: Analyzing trace with hash 601099510, now seen corresponding path program 370 times [2020-02-10 19:45:36,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676656786] [2020-02-10 19:45:36,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,474 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:45:36,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676656786] [2020-02-10 19:45:36,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:36,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989883436] [2020-02-10 19:45:36,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:36,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:36,475 INFO L87 Difference]: Start difference. First operand 187 states and 539 transitions. Second operand 8 states. [2020-02-10 19:45:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,534 INFO L93 Difference]: Finished difference Result 304 states and 735 transitions. [2020-02-10 19:45:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:36,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,535 INFO L225 Difference]: With dead ends: 304 [2020-02-10 19:45:36,536 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 19:45:36,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 19:45:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-02-10 19:45:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2020-02-10 19:45:36,541 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 19 [2020-02-10 19:45:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,541 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2020-02-10 19:45:36,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2020-02-10 19:45:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:36,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:36,542 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2030620292, now seen corresponding path program 371 times [2020-02-10 19:45:36,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829787687] [2020-02-10 19:45:36,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:36,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829787687] [2020-02-10 19:45:36,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:36,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393200519] [2020-02-10 19:45:36,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:36,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:36,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:36,741 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand 8 states. [2020-02-10 19:45:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,832 INFO L93 Difference]: Finished difference Result 305 states and 739 transitions. [2020-02-10 19:45:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:36,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,833 INFO L225 Difference]: With dead ends: 305 [2020-02-10 19:45:36,833 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 19:45:36,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 19:45:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-02-10 19:45:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-02-10 19:45:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 535 transitions. [2020-02-10 19:45:36,837 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 535 transitions. Word has length 19 [2020-02-10 19:45:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,837 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 535 transitions. [2020-02-10 19:45:36,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 535 transitions. [2020-02-10 19:45:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:36,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:36,838 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash -910490462, now seen corresponding path program 372 times [2020-02-10 19:45:36,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710124553] [2020-02-10 19:45:36,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,059 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:45:37,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710124553] [2020-02-10 19:45:37,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:37,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169152635] [2020-02-10 19:45:37,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:37,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:37,060 INFO L87 Difference]: Start difference. First operand 186 states and 535 transitions. Second operand 8 states. [2020-02-10 19:45:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,128 INFO L93 Difference]: Finished difference Result 301 states and 728 transitions. [2020-02-10 19:45:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:37,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,129 INFO L225 Difference]: With dead ends: 301 [2020-02-10 19:45:37,129 INFO L226 Difference]: Without dead ends: 285 [2020-02-10 19:45:37,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-02-10 19:45:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-02-10 19:45:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 19:45:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 524 transitions. [2020-02-10 19:45:37,133 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 524 transitions. Word has length 19 [2020-02-10 19:45:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,134 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 524 transitions. [2020-02-10 19:45:37,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 524 transitions. [2020-02-10 19:45:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:37,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:37,134 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -304821912, now seen corresponding path program 373 times [2020-02-10 19:45:37,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118348297] [2020-02-10 19:45:37,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,338 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:45:37,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118348297] [2020-02-10 19:45:37,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:37,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501172842] [2020-02-10 19:45:37,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:37,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:37,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:37,339 INFO L87 Difference]: Start difference. First operand 180 states and 524 transitions. Second operand 8 states. [2020-02-10 19:45:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,400 INFO L93 Difference]: Finished difference Result 298 states and 719 transitions. [2020-02-10 19:45:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:37,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,401 INFO L225 Difference]: With dead ends: 298 [2020-02-10 19:45:37,401 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 19:45:37,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 19:45:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-02-10 19:45:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 19:45:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 534 transitions. [2020-02-10 19:45:37,406 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 534 transitions. Word has length 19 [2020-02-10 19:45:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,406 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 534 transitions. [2020-02-10 19:45:37,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 534 transitions. [2020-02-10 19:45:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:37,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:37,406 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1838418838, now seen corresponding path program 374 times [2020-02-10 19:45:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437426724] [2020-02-10 19:45:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:37,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437426724] [2020-02-10 19:45:37,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:37,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924225230] [2020-02-10 19:45:37,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:37,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:37,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:37,622 INFO L87 Difference]: Start difference. First operand 185 states and 534 transitions. Second operand 8 states. [2020-02-10 19:45:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,711 INFO L93 Difference]: Finished difference Result 292 states and 704 transitions. [2020-02-10 19:45:37,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:37,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,713 INFO L225 Difference]: With dead ends: 292 [2020-02-10 19:45:37,713 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 19:45:37,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 19:45:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-02-10 19:45:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 19:45:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 528 transitions. [2020-02-10 19:45:37,717 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 528 transitions. Word has length 19 [2020-02-10 19:45:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,717 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 528 transitions. [2020-02-10 19:45:37,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 528 transitions. [2020-02-10 19:45:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:37,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:37,718 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1905259766, now seen corresponding path program 375 times [2020-02-10 19:45:37,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888417143] [2020-02-10 19:45:37,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,984 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:45:37,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888417143] [2020-02-10 19:45:37,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:37,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479420746] [2020-02-10 19:45:37,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:37,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:37,985 INFO L87 Difference]: Start difference. First operand 182 states and 528 transitions. Second operand 8 states. [2020-02-10 19:45:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,044 INFO L93 Difference]: Finished difference Result 298 states and 717 transitions. [2020-02-10 19:45:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:38,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,045 INFO L225 Difference]: With dead ends: 298 [2020-02-10 19:45:38,045 INFO L226 Difference]: Without dead ends: 282 [2020-02-10 19:45:38,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-02-10 19:45:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-02-10 19:45:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 19:45:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 532 transitions. [2020-02-10 19:45:38,050 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 532 transitions. Word has length 19 [2020-02-10 19:45:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,050 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 532 transitions. [2020-02-10 19:45:38,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 532 transitions. [2020-02-10 19:45:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:38,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:38,051 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1646201540, now seen corresponding path program 376 times [2020-02-10 19:45:38,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896197942] [2020-02-10 19:45:38,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,250 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:45:38,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896197942] [2020-02-10 19:45:38,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:38,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696361769] [2020-02-10 19:45:38,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:38,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:38,252 INFO L87 Difference]: Start difference. First operand 185 states and 532 transitions. Second operand 8 states. [2020-02-10 19:45:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,323 INFO L93 Difference]: Finished difference Result 292 states and 702 transitions. [2020-02-10 19:45:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:38,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,325 INFO L225 Difference]: With dead ends: 292 [2020-02-10 19:45:38,325 INFO L226 Difference]: Without dead ends: 279 [2020-02-10 19:45:38,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-02-10 19:45:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-02-10 19:45:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 19:45:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 526 transitions. [2020-02-10 19:45:38,329 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 526 transitions. Word has length 19 [2020-02-10 19:45:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,329 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 526 transitions. [2020-02-10 19:45:38,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 526 transitions. [2020-02-10 19:45:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:38,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:38,330 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1408327434, now seen corresponding path program 377 times [2020-02-10 19:45:38,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960672569] [2020-02-10 19:45:38,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,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:45:38,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960672569] [2020-02-10 19:45:38,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:38,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379102018] [2020-02-10 19:45:38,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:38,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:38,539 INFO L87 Difference]: Start difference. First operand 182 states and 526 transitions. Second operand 8 states. [2020-02-10 19:45:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,618 INFO L93 Difference]: Finished difference Result 284 states and 686 transitions. [2020-02-10 19:45:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:38,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,619 INFO L225 Difference]: With dead ends: 284 [2020-02-10 19:45:38,619 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 19:45:38,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 19:45:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 19:45:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 19:45:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-02-10 19:45:38,624 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-02-10 19:45:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,624 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-02-10 19:45:38,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-02-10 19:45:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:38,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:38,625 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1168685096, now seen corresponding path program 378 times [2020-02-10 19:45:38,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085472284] [2020-02-10 19:45:38,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,833 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:45:38,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085472284] [2020-02-10 19:45:38,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:38,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604862905] [2020-02-10 19:45:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:38,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:38,835 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-02-10 19:45:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,899 INFO L93 Difference]: Finished difference Result 284 states and 685 transitions. [2020-02-10 19:45:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:38,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,900 INFO L225 Difference]: With dead ends: 284 [2020-02-10 19:45:38,900 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 19:45:38,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 19:45:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2020-02-10 19:45:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 19:45:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2020-02-10 19:45:38,905 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 19 [2020-02-10 19:45:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,905 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2020-02-10 19:45:38,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2020-02-10 19:45:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:38,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:38,905 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1264971302, now seen corresponding path program 379 times [2020-02-10 19:45:38,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799946779] [2020-02-10 19:45:38,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,106 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:45:39,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799946779] [2020-02-10 19:45:39,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:39,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367376190] [2020-02-10 19:45:39,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:39,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:39,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:39,108 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand 8 states. [2020-02-10 19:45:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:39,193 INFO L93 Difference]: Finished difference Result 288 states and 699 transitions. [2020-02-10 19:45:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:39,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:39,194 INFO L225 Difference]: With dead ends: 288 [2020-02-10 19:45:39,194 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 19:45:39,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 19:45:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 19:45:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 19:45:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 528 transitions. [2020-02-10 19:45:39,198 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 528 transitions. Word has length 19 [2020-02-10 19:45:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,198 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 528 transitions. [2020-02-10 19:45:39,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 528 transitions. [2020-02-10 19:45:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:39,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:39,199 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2139306628, now seen corresponding path program 380 times [2020-02-10 19:45:39,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308143858] [2020-02-10 19:45:39,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,403 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:45:39,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308143858] [2020-02-10 19:45:39,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:39,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918186198] [2020-02-10 19:45:39,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:39,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:39,405 INFO L87 Difference]: Start difference. First operand 183 states and 528 transitions. Second operand 8 states. [2020-02-10 19:45:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:39,483 INFO L93 Difference]: Finished difference Result 284 states and 688 transitions. [2020-02-10 19:45:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:39,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:39,485 INFO L225 Difference]: With dead ends: 284 [2020-02-10 19:45:39,486 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 19:45:39,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 19:45:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-02-10 19:45:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 19:45:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 524 transitions. [2020-02-10 19:45:39,491 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 524 transitions. Word has length 19 [2020-02-10 19:45:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,491 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 524 transitions. [2020-02-10 19:45:39,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 524 transitions. [2020-02-10 19:45:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:39,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:39,492 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash -103949188, now seen corresponding path program 381 times [2020-02-10 19:45:39,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381817737] [2020-02-10 19:45:39,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,698 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:45:39,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381817737] [2020-02-10 19:45:39,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:39,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37092602] [2020-02-10 19:45:39,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:39,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:39,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:39,700 INFO L87 Difference]: Start difference. First operand 181 states and 524 transitions. Second operand 8 states. [2020-02-10 19:45:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:39,776 INFO L93 Difference]: Finished difference Result 288 states and 698 transitions. [2020-02-10 19:45:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:39,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:39,777 INFO L225 Difference]: With dead ends: 288 [2020-02-10 19:45:39,777 INFO L226 Difference]: Without dead ends: 274 [2020-02-10 19:45:39,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-02-10 19:45:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-02-10 19:45:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 19:45:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-02-10 19:45:39,781 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-02-10 19:45:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,781 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-02-10 19:45:39,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-02-10 19:45:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:39,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:39,782 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1016180642, now seen corresponding path program 382 times [2020-02-10 19:45:39,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187071579] [2020-02-10 19:45:39,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,985 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:45:39,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187071579] [2020-02-10 19:45:39,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:39,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957988371] [2020-02-10 19:45:39,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:39,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:39,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:39,987 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-02-10 19:45:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,048 INFO L93 Difference]: Finished difference Result 284 states and 687 transitions. [2020-02-10 19:45:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:40,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,049 INFO L225 Difference]: With dead ends: 284 [2020-02-10 19:45:40,049 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 19:45:40,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 19:45:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-02-10 19:45:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 19:45:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 523 transitions. [2020-02-10 19:45:40,054 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 523 transitions. Word has length 19 [2020-02-10 19:45:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,054 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 523 transitions. [2020-02-10 19:45:40,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 523 transitions. [2020-02-10 19:45:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:40,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:40,054 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1793678558, now seen corresponding path program 383 times [2020-02-10 19:45:40,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754483803] [2020-02-10 19:45:40,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:40,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754483803] [2020-02-10 19:45:40,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:40,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483927394] [2020-02-10 19:45:40,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:40,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:40,272 INFO L87 Difference]: Start difference. First operand 181 states and 523 transitions. Second operand 8 states. [2020-02-10 19:45:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,349 INFO L93 Difference]: Finished difference Result 279 states and 676 transitions. [2020-02-10 19:45:40,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:40,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,350 INFO L225 Difference]: With dead ends: 279 [2020-02-10 19:45:40,350 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 19:45:40,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 19:45:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 182. [2020-02-10 19:45:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-02-10 19:45:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 524 transitions. [2020-02-10 19:45:40,355 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 524 transitions. Word has length 19 [2020-02-10 19:45:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,355 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 524 transitions. [2020-02-10 19:45:40,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 524 transitions. [2020-02-10 19:45:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:40,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,356 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:40,356 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1554036220, now seen corresponding path program 384 times [2020-02-10 19:45:40,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312727698] [2020-02-10 19:45:40,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:40,577 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:45:40,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312727698] [2020-02-10 19:45:40,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:40,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504994617] [2020-02-10 19:45:40,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:40,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:40,579 INFO L87 Difference]: Start difference. First operand 182 states and 524 transitions. Second operand 8 states. [2020-02-10 19:45:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,649 INFO L93 Difference]: Finished difference Result 279 states and 675 transitions. [2020-02-10 19:45:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:40,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,650 INFO L225 Difference]: With dead ends: 279 [2020-02-10 19:45:40,650 INFO L226 Difference]: Without dead ends: 264 [2020-02-10 19:45:40,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-02-10 19:45:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 177. [2020-02-10 19:45:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 19:45:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 516 transitions. [2020-02-10 19:45:40,655 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 516 transitions. Word has length 19 [2020-02-10 19:45:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,656 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 516 transitions. [2020-02-10 19:45:40,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 516 transitions. [2020-02-10 19:45:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:40,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:40,656 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,656 INFO L82 PathProgramCache]: Analyzing trace with hash 22174086, now seen corresponding path program 385 times [2020-02-10 19:45:40,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857677837] [2020-02-10 19:45:40,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:40,862 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:45:40,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857677837] [2020-02-10 19:45:40,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:40,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449229952] [2020-02-10 19:45:40,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:40,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:40,864 INFO L87 Difference]: Start difference. First operand 177 states and 516 transitions. Second operand 8 states. [2020-02-10 19:45:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,923 INFO L93 Difference]: Finished difference Result 321 states and 784 transitions. [2020-02-10 19:45:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:40,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,924 INFO L225 Difference]: With dead ends: 321 [2020-02-10 19:45:40,924 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 19:45:40,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 19:45:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 185. [2020-02-10 19:45:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-02-10 19:45:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 530 transitions. [2020-02-10 19:45:40,929 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 530 transitions. Word has length 19 [2020-02-10 19:45:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,929 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 530 transitions. [2020-02-10 19:45:40,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 530 transitions. [2020-02-10 19:45:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:40,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:40,930 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 396825272, now seen corresponding path program 386 times [2020-02-10 19:45:40,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523661761] [2020-02-10 19:45:40,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,122 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:45:41,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523661761] [2020-02-10 19:45:41,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:41,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086411264] [2020-02-10 19:45:41,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:41,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:41,124 INFO L87 Difference]: Start difference. First operand 185 states and 530 transitions. Second operand 8 states. [2020-02-10 19:45:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,207 INFO L93 Difference]: Finished difference Result 319 states and 774 transitions. [2020-02-10 19:45:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:41,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,209 INFO L225 Difference]: With dead ends: 319 [2020-02-10 19:45:41,209 INFO L226 Difference]: Without dead ends: 297 [2020-02-10 19:45:41,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-02-10 19:45:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 177. [2020-02-10 19:45:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 19:45:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 512 transitions. [2020-02-10 19:45:41,213 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 512 transitions. Word has length 19 [2020-02-10 19:45:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,213 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 512 transitions. [2020-02-10 19:45:41,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 512 transitions. [2020-02-10 19:45:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:41,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:41,214 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash 226775168, now seen corresponding path program 387 times [2020-02-10 19:45:41,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718472092] [2020-02-10 19:45:41,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,408 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:45:41,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718472092] [2020-02-10 19:45:41,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:41,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579347847] [2020-02-10 19:45:41,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:41,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:41,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:41,409 INFO L87 Difference]: Start difference. First operand 177 states and 512 transitions. Second operand 8 states. [2020-02-10 19:45:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,463 INFO L93 Difference]: Finished difference Result 312 states and 757 transitions. [2020-02-10 19:45:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:41,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,465 INFO L225 Difference]: With dead ends: 312 [2020-02-10 19:45:41,465 INFO L226 Difference]: Without dead ends: 296 [2020-02-10 19:45:41,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-02-10 19:45:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 180. [2020-02-10 19:45:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-02-10 19:45:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 516 transitions. [2020-02-10 19:45:41,470 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 516 transitions. Word has length 19 [2020-02-10 19:45:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,470 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 516 transitions. [2020-02-10 19:45:41,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 516 transitions. [2020-02-10 19:45:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:41,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:41,470 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1924951378, now seen corresponding path program 388 times [2020-02-10 19:45:41,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666171660] [2020-02-10 19:45:41,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,663 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:45:41,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666171660] [2020-02-10 19:45:41,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:41,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459439650] [2020-02-10 19:45:41,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:41,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:41,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:41,664 INFO L87 Difference]: Start difference. First operand 180 states and 516 transitions. Second operand 8 states. [2020-02-10 19:45:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,742 INFO L93 Difference]: Finished difference Result 306 states and 742 transitions. [2020-02-10 19:45:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:41,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,743 INFO L225 Difference]: With dead ends: 306 [2020-02-10 19:45:41,743 INFO L226 Difference]: Without dead ends: 293 [2020-02-10 19:45:41,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-02-10 19:45:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 177. [2020-02-10 19:45:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 19:45:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 509 transitions. [2020-02-10 19:45:41,748 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 509 transitions. Word has length 19 [2020-02-10 19:45:41,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,748 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 509 transitions. [2020-02-10 19:45:41,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 509 transitions. [2020-02-10 19:45:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:41,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:41,748 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1171240866, now seen corresponding path program 389 times [2020-02-10 19:45:41,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295568304] [2020-02-10 19:45:41,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,934 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:45:41,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295568304] [2020-02-10 19:45:41,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:41,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422998968] [2020-02-10 19:45:41,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:41,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:41,936 INFO L87 Difference]: Start difference. First operand 177 states and 509 transitions. Second operand 8 states. [2020-02-10 19:45:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,012 INFO L93 Difference]: Finished difference Result 307 states and 746 transitions. [2020-02-10 19:45:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:42,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,014 INFO L225 Difference]: With dead ends: 307 [2020-02-10 19:45:42,014 INFO L226 Difference]: Without dead ends: 293 [2020-02-10 19:45:42,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-02-10 19:45:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 179. [2020-02-10 19:45:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 19:45:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 512 transitions. [2020-02-10 19:45:42,018 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 512 transitions. Word has length 19 [2020-02-10 19:45:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,018 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 512 transitions. [2020-02-10 19:45:42,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 512 transitions. [2020-02-10 19:45:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:42,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:42,019 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2045576192, now seen corresponding path program 390 times [2020-02-10 19:45:42,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804418257] [2020-02-10 19:45:42,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:42,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804418257] [2020-02-10 19:45:42,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:42,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972847504] [2020-02-10 19:45:42,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:42,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:42,209 INFO L87 Difference]: Start difference. First operand 179 states and 512 transitions. Second operand 8 states. [2020-02-10 19:45:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,292 INFO L93 Difference]: Finished difference Result 303 states and 735 transitions. [2020-02-10 19:45:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:42,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,294 INFO L225 Difference]: With dead ends: 303 [2020-02-10 19:45:42,294 INFO L226 Difference]: Without dead ends: 287 [2020-02-10 19:45:42,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-02-10 19:45:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 173. [2020-02-10 19:45:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 19:45:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 500 transitions. [2020-02-10 19:45:42,298 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 500 transitions. Word has length 19 [2020-02-10 19:45:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,298 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 500 transitions. [2020-02-10 19:45:42,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 500 transitions. [2020-02-10 19:45:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:42,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:42,299 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:42,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash -822797366, now seen corresponding path program 391 times [2020-02-10 19:45:42,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743220345] [2020-02-10 19:45:42,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,520 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:45:42,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743220345] [2020-02-10 19:45:42,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:42,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608292198] [2020-02-10 19:45:42,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:42,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:42,521 INFO L87 Difference]: Start difference. First operand 173 states and 500 transitions. Second operand 8 states. [2020-02-10 19:45:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,579 INFO L93 Difference]: Finished difference Result 321 states and 787 transitions. [2020-02-10 19:45:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:42,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,580 INFO L225 Difference]: With dead ends: 321 [2020-02-10 19:45:42,580 INFO L226 Difference]: Without dead ends: 305 [2020-02-10 19:45:42,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-02-10 19:45:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 187. [2020-02-10 19:45:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-02-10 19:45:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 535 transitions. [2020-02-10 19:45:42,585 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 535 transitions. Word has length 19 [2020-02-10 19:45:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,585 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 535 transitions. [2020-02-10 19:45:42,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 535 transitions. [2020-02-10 19:45:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:42,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:42,586 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash -448146180, now seen corresponding path program 392 times [2020-02-10 19:45:42,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808943002] [2020-02-10 19:45:42,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:42,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808943002] [2020-02-10 19:45:42,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:42,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069060012] [2020-02-10 19:45:42,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:42,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:42,787 INFO L87 Difference]: Start difference. First operand 187 states and 535 transitions. Second operand 8 states. [2020-02-10 19:45:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,858 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-02-10 19:45:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:42,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,859 INFO L225 Difference]: With dead ends: 319 [2020-02-10 19:45:42,859 INFO L226 Difference]: Without dead ends: 297 [2020-02-10 19:45:42,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-02-10 19:45:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 179. [2020-02-10 19:45:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 19:45:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 515 transitions. [2020-02-10 19:45:42,864 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 515 transitions. Word has length 19 [2020-02-10 19:45:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,864 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 515 transitions. [2020-02-10 19:45:42,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 515 transitions. [2020-02-10 19:45:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:42,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:42,864 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 32996164, now seen corresponding path program 393 times [2020-02-10 19:45:42,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195220960] [2020-02-10 19:45:42,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,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:45:43,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195220960] [2020-02-10 19:45:43,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:43,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480504814] [2020-02-10 19:45:43,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:43,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:43,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:43,060 INFO L87 Difference]: Start difference. First operand 179 states and 515 transitions. Second operand 8 states. [2020-02-10 19:45:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,121 INFO L93 Difference]: Finished difference Result 308 states and 755 transitions. [2020-02-10 19:45:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:43,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,122 INFO L225 Difference]: With dead ends: 308 [2020-02-10 19:45:43,122 INFO L226 Difference]: Without dead ends: 292 [2020-02-10 19:45:43,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-02-10 19:45:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 184. [2020-02-10 19:45:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-02-10 19:45:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 524 transitions. [2020-02-10 19:45:43,126 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 524 transitions. Word has length 19 [2020-02-10 19:45:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,127 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 524 transitions. [2020-02-10 19:45:43,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 524 transitions. [2020-02-10 19:45:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:43,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,127 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:43,127 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -718065930, now seen corresponding path program 394 times [2020-02-10 19:45:43,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505994804] [2020-02-10 19:45:43,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,323 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:45:43,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505994804] [2020-02-10 19:45:43,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:43,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199541876] [2020-02-10 19:45:43,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:43,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:43,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:43,324 INFO L87 Difference]: Start difference. First operand 184 states and 524 transitions. Second operand 8 states. [2020-02-10 19:45:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,402 INFO L93 Difference]: Finished difference Result 295 states and 734 transitions. [2020-02-10 19:45:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:43,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,403 INFO L225 Difference]: With dead ends: 295 [2020-02-10 19:45:43,403 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 19:45:43,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 19:45:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-02-10 19:45:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 19:45:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-02-10 19:45:43,408 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-02-10 19:45:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,408 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-02-10 19:45:43,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-02-10 19:45:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:43,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:43,409 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1988186406, now seen corresponding path program 395 times [2020-02-10 19:45:43,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484621900] [2020-02-10 19:45:43,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,599 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:45:43,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484621900] [2020-02-10 19:45:43,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:43,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538603663] [2020-02-10 19:45:43,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:43,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:43,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:43,601 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-02-10 19:45:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,679 INFO L93 Difference]: Finished difference Result 305 states and 745 transitions. [2020-02-10 19:45:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:43,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,680 INFO L225 Difference]: With dead ends: 305 [2020-02-10 19:45:43,680 INFO L226 Difference]: Without dead ends: 291 [2020-02-10 19:45:43,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-02-10 19:45:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 183. [2020-02-10 19:45:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-02-10 19:45:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 518 transitions. [2020-02-10 19:45:43,685 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 518 transitions. Word has length 19 [2020-02-10 19:45:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,685 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 518 transitions. [2020-02-10 19:45:43,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 518 transitions. [2020-02-10 19:45:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:43,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:43,686 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:43,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1988781052, now seen corresponding path program 396 times [2020-02-10 19:45:43,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364763444] [2020-02-10 19:45:43,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,874 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:45:43,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364763444] [2020-02-10 19:45:43,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:43,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648608729] [2020-02-10 19:45:43,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:43,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:43,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:43,875 INFO L87 Difference]: Start difference. First operand 183 states and 518 transitions. Second operand 8 states. [2020-02-10 19:45:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,953 INFO L93 Difference]: Finished difference Result 294 states and 728 transitions. [2020-02-10 19:45:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:43,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,954 INFO L225 Difference]: With dead ends: 294 [2020-02-10 19:45:43,954 INFO L226 Difference]: Without dead ends: 272 [2020-02-10 19:45:43,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-02-10 19:45:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 173. [2020-02-10 19:45:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 19:45:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 496 transitions. [2020-02-10 19:45:43,958 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 496 transitions. Word has length 19 [2020-02-10 19:45:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,958 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 496 transitions. [2020-02-10 19:45:43,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 496 transitions. [2020-02-10 19:45:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:43,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:43,959 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:43,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash 986570822, now seen corresponding path program 397 times [2020-02-10 19:45:43,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935213558] [2020-02-10 19:45:43,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,152 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:45:44,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935213558] [2020-02-10 19:45:44,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:44,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418882407] [2020-02-10 19:45:44,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:44,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:44,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:44,154 INFO L87 Difference]: Start difference. First operand 173 states and 496 transitions. Second operand 8 states. [2020-02-10 19:45:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,212 INFO L93 Difference]: Finished difference Result 303 states and 733 transitions. [2020-02-10 19:45:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:44,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,213 INFO L225 Difference]: With dead ends: 303 [2020-02-10 19:45:44,213 INFO L226 Difference]: Without dead ends: 287 [2020-02-10 19:45:44,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-02-10 19:45:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2020-02-10 19:45:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 19:45:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-02-10 19:45:44,217 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-02-10 19:45:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,217 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-02-10 19:45:44,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-02-10 19:45:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:44,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:44,218 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:44,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1165155724, now seen corresponding path program 398 times [2020-02-10 19:45:44,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036749453] [2020-02-10 19:45:44,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,424 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:45:44,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036749453] [2020-02-10 19:45:44,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:44,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463889508] [2020-02-10 19:45:44,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:44,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:44,426 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-02-10 19:45:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,509 INFO L93 Difference]: Finished difference Result 297 states and 718 transitions. [2020-02-10 19:45:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:44,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,510 INFO L225 Difference]: With dead ends: 297 [2020-02-10 19:45:44,511 INFO L226 Difference]: Without dead ends: 284 [2020-02-10 19:45:44,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-02-10 19:45:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 176. [2020-02-10 19:45:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-02-10 19:45:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 503 transitions. [2020-02-10 19:45:44,516 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 503 transitions. Word has length 19 [2020-02-10 19:45:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,516 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 503 transitions. [2020-02-10 19:45:44,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 503 transitions. [2020-02-10 19:45:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:44,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:44,517 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2080662410, now seen corresponding path program 399 times [2020-02-10 19:45:44,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047288665] [2020-02-10 19:45:44,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,716 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:45:44,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047288665] [2020-02-10 19:45:44,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:44,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296349610] [2020-02-10 19:45:44,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:44,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:44,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:44,718 INFO L87 Difference]: Start difference. First operand 176 states and 503 transitions. Second operand 8 states. [2020-02-10 19:45:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,776 INFO L93 Difference]: Finished difference Result 299 states and 727 transitions. [2020-02-10 19:45:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:44,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,777 INFO L225 Difference]: With dead ends: 299 [2020-02-10 19:45:44,777 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 19:45:44,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 19:45:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2020-02-10 19:45:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-02-10 19:45:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 512 transitions. [2020-02-10 19:45:44,782 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 512 transitions. Word has length 19 [2020-02-10 19:45:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,782 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 512 transitions. [2020-02-10 19:45:44,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 512 transitions. [2020-02-10 19:45:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:44,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:44,783 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1329600316, now seen corresponding path program 400 times [2020-02-10 19:45:44,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592554159] [2020-02-10 19:45:44,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,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:45:44,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592554159] [2020-02-10 19:45:44,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:44,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477034933] [2020-02-10 19:45:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:44,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:44,978 INFO L87 Difference]: Start difference. First operand 181 states and 512 transitions. Second operand 8 states. [2020-02-10 19:45:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,060 INFO L93 Difference]: Finished difference Result 286 states and 706 transitions. [2020-02-10 19:45:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:45,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,061 INFO L225 Difference]: With dead ends: 286 [2020-02-10 19:45:45,061 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 19:45:45,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 19:45:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2020-02-10 19:45:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-02-10 19:45:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 500 transitions. [2020-02-10 19:45:45,066 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 500 transitions. Word has length 19 [2020-02-10 19:45:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,066 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 500 transitions. [2020-02-10 19:45:45,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 500 transitions. [2020-02-10 19:45:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:45,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:45,067 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:45,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1804719824, now seen corresponding path program 401 times [2020-02-10 19:45:45,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946515349] [2020-02-10 19:45:45,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:45,264 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:45:45,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946515349] [2020-02-10 19:45:45,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:45,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:45,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193885589] [2020-02-10 19:45:45,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:45,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:45,265 INFO L87 Difference]: Start difference. First operand 176 states and 500 transitions. Second operand 8 states. [2020-02-10 19:45:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,337 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-02-10 19:45:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:45,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,338 INFO L225 Difference]: With dead ends: 290 [2020-02-10 19:45:45,338 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 19:45:45,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 19:45:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 178. [2020-02-10 19:45:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-02-10 19:45:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 503 transitions. [2020-02-10 19:45:45,343 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 503 transitions. Word has length 19 [2020-02-10 19:45:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,343 INFO L479 AbstractCegarLoop]: Abstraction has 178 states and 503 transitions. [2020-02-10 19:45:45,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 503 transitions. [2020-02-10 19:45:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:45,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:45,343 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:45,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,344 INFO L82 PathProgramCache]: Analyzing trace with hash -94106516, now seen corresponding path program 402 times [2020-02-10 19:45:45,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245626570] [2020-02-10 19:45:45,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:45,534 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:45:45,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245626570] [2020-02-10 19:45:45,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:45,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:45,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838260460] [2020-02-10 19:45:45,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:45,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:45,536 INFO L87 Difference]: Start difference. First operand 178 states and 503 transitions. Second operand 8 states. [2020-02-10 19:45:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,611 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-02-10 19:45:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:45,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,612 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:45,612 INFO L226 Difference]: Without dead ends: 266 [2020-02-10 19:45:45,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-02-10 19:45:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 173. [2020-02-10 19:45:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-02-10 19:45:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 493 transitions. [2020-02-10 19:45:45,617 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 493 transitions. Word has length 19 [2020-02-10 19:45:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,617 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 493 transitions. [2020-02-10 19:45:45,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 493 transitions. [2020-02-10 19:45:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:45,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:45,618 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 196668370, now seen corresponding path program 403 times [2020-02-10 19:45:45,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430166623] [2020-02-10 19:45:45,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:45,795 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:45:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430166623] [2020-02-10 19:45:45,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:45,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:45,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155376728] [2020-02-10 19:45:45,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:45,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:45,797 INFO L87 Difference]: Start difference. First operand 173 states and 493 transitions. Second operand 8 states. [2020-02-10 19:45:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,877 INFO L93 Difference]: Finished difference Result 294 states and 714 transitions. [2020-02-10 19:45:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:45,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,877 INFO L225 Difference]: With dead ends: 294 [2020-02-10 19:45:45,877 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 19:45:45,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 19:45:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 177. [2020-02-10 19:45:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 19:45:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 503 transitions. [2020-02-10 19:45:45,881 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 503 transitions. Word has length 19 [2020-02-10 19:45:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,882 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 503 transitions. [2020-02-10 19:45:45,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 503 transitions. [2020-02-10 19:45:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:45,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:45,882 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash -677666956, now seen corresponding path program 404 times [2020-02-10 19:45:45,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793929323] [2020-02-10 19:45:45,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,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:45:46,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793929323] [2020-02-10 19:45:46,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:46,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939842720] [2020-02-10 19:45:46,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:46,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:46,054 INFO L87 Difference]: Start difference. First operand 177 states and 503 transitions. Second operand 8 states. [2020-02-10 19:45:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,129 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-02-10 19:45:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:46,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,130 INFO L225 Difference]: With dead ends: 290 [2020-02-10 19:45:46,130 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 19:45:46,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 19:45:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2020-02-10 19:45:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-02-10 19:45:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 498 transitions. [2020-02-10 19:45:46,134 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 498 transitions. Word has length 19 [2020-02-10 19:45:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,134 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 498 transitions. [2020-02-10 19:45:46,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 498 transitions. [2020-02-10 19:45:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:46,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,135 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:46,135 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1686073366, now seen corresponding path program 405 times [2020-02-10 19:45:46,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605484083] [2020-02-10 19:45:46,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,308 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:45:46,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605484083] [2020-02-10 19:45:46,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:46,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551204796] [2020-02-10 19:45:46,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:46,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:46,309 INFO L87 Difference]: Start difference. First operand 175 states and 498 transitions. Second operand 8 states. [2020-02-10 19:45:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,383 INFO L93 Difference]: Finished difference Result 292 states and 712 transitions. [2020-02-10 19:45:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:46,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,384 INFO L225 Difference]: With dead ends: 292 [2020-02-10 19:45:46,384 INFO L226 Difference]: Without dead ends: 278 [2020-02-10 19:45:46,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-02-10 19:45:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-02-10 19:45:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-02-10 19:45:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 506 transitions. [2020-02-10 19:45:46,389 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 506 transitions. Word has length 19 [2020-02-10 19:45:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,389 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 506 transitions. [2020-02-10 19:45:46,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 506 transitions. [2020-02-10 19:45:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:46,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:46,389 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash 940776222, now seen corresponding path program 406 times [2020-02-10 19:45:46,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231466567] [2020-02-10 19:45:46,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,561 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:45:46,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231466567] [2020-02-10 19:45:46,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:46,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118377960] [2020-02-10 19:45:46,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:46,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:46,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:46,563 INFO L87 Difference]: Start difference. First operand 179 states and 506 transitions. Second operand 8 states. [2020-02-10 19:45:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,641 INFO L93 Difference]: Finished difference Result 281 states and 695 transitions. [2020-02-10 19:45:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:46,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,642 INFO L225 Difference]: With dead ends: 281 [2020-02-10 19:45:46,643 INFO L226 Difference]: Without dead ends: 265 [2020-02-10 19:45:46,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-02-10 19:45:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 175. [2020-02-10 19:45:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-02-10 19:45:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 496 transitions. [2020-02-10 19:45:46,647 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 496 transitions. Word has length 19 [2020-02-10 19:45:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,647 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 496 transitions. [2020-02-10 19:45:46,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 496 transitions. [2020-02-10 19:45:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:46,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:46,648 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1249121762, now seen corresponding path program 407 times [2020-02-10 19:45:46,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359846279] [2020-02-10 19:45:46,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,859 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:45:46,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359846279] [2020-02-10 19:45:46,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:46,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756463627] [2020-02-10 19:45:46,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:46,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:46,861 INFO L87 Difference]: Start difference. First operand 175 states and 496 transitions. Second operand 8 states. [2020-02-10 19:45:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,935 INFO L93 Difference]: Finished difference Result 286 states and 694 transitions. [2020-02-10 19:45:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:46,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,936 INFO L225 Difference]: With dead ends: 286 [2020-02-10 19:45:46,936 INFO L226 Difference]: Without dead ends: 276 [2020-02-10 19:45:46,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-02-10 19:45:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-02-10 19:45:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 19:45:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-02-10 19:45:46,940 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-02-10 19:45:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,940 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-02-10 19:45:46,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-02-10 19:45:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:46,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:46,941 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash 461491546, now seen corresponding path program 408 times [2020-02-10 19:45:46,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95775608] [2020-02-10 19:45:46,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,118 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:45:47,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95775608] [2020-02-10 19:45:47,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:47,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687587819] [2020-02-10 19:45:47,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:47,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:47,120 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-02-10 19:45:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,204 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-02-10 19:45:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:47,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,205 INFO L225 Difference]: With dead ends: 279 [2020-02-10 19:45:47,205 INFO L226 Difference]: Without dead ends: 259 [2020-02-10 19:45:47,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-02-10 19:45:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2020-02-10 19:45:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 19:45:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 485 transitions. [2020-02-10 19:45:47,210 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 485 transitions. Word has length 19 [2020-02-10 19:45:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,211 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 485 transitions. [2020-02-10 19:45:47,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 485 transitions. [2020-02-10 19:45:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:47,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:47,211 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -612467258, now seen corresponding path program 409 times [2020-02-10 19:45:47,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730486148] [2020-02-10 19:45:47,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,412 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:45:47,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730486148] [2020-02-10 19:45:47,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:47,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264823628] [2020-02-10 19:45:47,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:47,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:47,414 INFO L87 Difference]: Start difference. First operand 169 states and 485 transitions. Second operand 8 states. [2020-02-10 19:45:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,470 INFO L93 Difference]: Finished difference Result 305 states and 732 transitions. [2020-02-10 19:45:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:47,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,471 INFO L225 Difference]: With dead ends: 305 [2020-02-10 19:45:47,471 INFO L226 Difference]: Without dead ends: 289 [2020-02-10 19:45:47,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-02-10 19:45:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 177. [2020-02-10 19:45:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-02-10 19:45:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-02-10 19:45:47,476 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-02-10 19:45:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,476 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-02-10 19:45:47,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-02-10 19:45:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:47,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:47,476 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,477 INFO L82 PathProgramCache]: Analyzing trace with hash -237816072, now seen corresponding path program 410 times [2020-02-10 19:45:47,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776338043] [2020-02-10 19:45:47,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,697 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:45:47,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776338043] [2020-02-10 19:45:47,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:47,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578031067] [2020-02-10 19:45:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:47,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:47,699 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-02-10 19:45:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,779 INFO L93 Difference]: Finished difference Result 303 states and 722 transitions. [2020-02-10 19:45:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:47,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,780 INFO L225 Difference]: With dead ends: 303 [2020-02-10 19:45:47,780 INFO L226 Difference]: Without dead ends: 281 [2020-02-10 19:45:47,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-02-10 19:45:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 169. [2020-02-10 19:45:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 19:45:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 481 transitions. [2020-02-10 19:45:47,785 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 481 transitions. Word has length 19 [2020-02-10 19:45:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,785 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 481 transitions. [2020-02-10 19:45:47,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 481 transitions. [2020-02-10 19:45:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:47,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:47,785 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash -82269952, now seen corresponding path program 411 times [2020-02-10 19:45:47,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846720516] [2020-02-10 19:45:47,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,974 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:45:47,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846720516] [2020-02-10 19:45:47,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:47,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404052057] [2020-02-10 19:45:47,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:47,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:47,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:47,975 INFO L87 Difference]: Start difference. First operand 169 states and 481 transitions. Second operand 8 states. [2020-02-10 19:45:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,030 INFO L93 Difference]: Finished difference Result 296 states and 705 transitions. [2020-02-10 19:45:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:48,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,031 INFO L225 Difference]: With dead ends: 296 [2020-02-10 19:45:48,031 INFO L226 Difference]: Without dead ends: 280 [2020-02-10 19:45:48,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-02-10 19:45:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 172. [2020-02-10 19:45:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-02-10 19:45:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 485 transitions. [2020-02-10 19:45:48,036 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 485 transitions. Word has length 19 [2020-02-10 19:45:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,036 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 485 transitions. [2020-02-10 19:45:48,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 485 transitions. [2020-02-10 19:45:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:48,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:48,037 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,037 INFO L82 PathProgramCache]: Analyzing trace with hash 176788274, now seen corresponding path program 412 times [2020-02-10 19:45:48,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684311236] [2020-02-10 19:45:48,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,231 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:45:48,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684311236] [2020-02-10 19:45:48,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:48,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749745487] [2020-02-10 19:45:48,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:48,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:48,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:48,233 INFO L87 Difference]: Start difference. First operand 172 states and 485 transitions. Second operand 8 states. [2020-02-10 19:45:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,291 INFO L93 Difference]: Finished difference Result 290 states and 690 transitions. [2020-02-10 19:45:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:48,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,292 INFO L225 Difference]: With dead ends: 290 [2020-02-10 19:45:48,292 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 19:45:48,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 19:45:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 169. [2020-02-10 19:45:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-02-10 19:45:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 478 transitions. [2020-02-10 19:45:48,296 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 478 transitions. Word has length 19 [2020-02-10 19:45:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,296 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 478 transitions. [2020-02-10 19:45:48,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 478 transitions. [2020-02-10 19:45:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:48,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:48,297 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1840035768, now seen corresponding path program 413 times [2020-02-10 19:45:48,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705260590] [2020-02-10 19:45:48,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,485 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:45:48,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705260590] [2020-02-10 19:45:48,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:48,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755750397] [2020-02-10 19:45:48,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:48,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:48,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:48,487 INFO L87 Difference]: Start difference. First operand 169 states and 478 transitions. Second operand 8 states. [2020-02-10 19:45:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,559 INFO L93 Difference]: Finished difference Result 291 states and 694 transitions. [2020-02-10 19:45:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:48,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,560 INFO L225 Difference]: With dead ends: 291 [2020-02-10 19:45:48,560 INFO L226 Difference]: Without dead ends: 277 [2020-02-10 19:45:48,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-02-10 19:45:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2020-02-10 19:45:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-02-10 19:45:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 481 transitions. [2020-02-10 19:45:48,564 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 481 transitions. Word has length 19 [2020-02-10 19:45:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,564 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 481 transitions. [2020-02-10 19:45:48,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 481 transitions. [2020-02-10 19:45:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:48,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:48,565 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1334801698, now seen corresponding path program 414 times [2020-02-10 19:45:48,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622286417] [2020-02-10 19:45:48,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,753 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:45:48,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622286417] [2020-02-10 19:45:48,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:48,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329947775] [2020-02-10 19:45:48,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:48,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:48,755 INFO L87 Difference]: Start difference. First operand 171 states and 481 transitions. Second operand 8 states. [2020-02-10 19:45:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,810 INFO L93 Difference]: Finished difference Result 287 states and 683 transitions. [2020-02-10 19:45:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:48,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,811 INFO L225 Difference]: With dead ends: 287 [2020-02-10 19:45:48,812 INFO L226 Difference]: Without dead ends: 271 [2020-02-10 19:45:48,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-02-10 19:45:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2020-02-10 19:45:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-02-10 19:45:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 469 transitions. [2020-02-10 19:45:48,816 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 469 transitions. Word has length 19 [2020-02-10 19:45:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,816 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 469 transitions. [2020-02-10 19:45:48,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 469 transitions. [2020-02-10 19:45:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:48,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:48,816 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1034952984, now seen corresponding path program 415 times [2020-02-10 19:45:48,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955652006] [2020-02-10 19:45:48,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,017 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:45:49,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955652006] [2020-02-10 19:45:49,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:49,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159628304] [2020-02-10 19:45:49,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:49,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:49,019 INFO L87 Difference]: Start difference. First operand 165 states and 469 transitions. Second operand 8 states. [2020-02-10 19:45:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,076 INFO L93 Difference]: Finished difference Result 299 states and 714 transitions. [2020-02-10 19:45:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:49,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,077 INFO L225 Difference]: With dead ends: 299 [2020-02-10 19:45:49,077 INFO L226 Difference]: Without dead ends: 283 [2020-02-10 19:45:49,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-02-10 19:45:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 165. [2020-02-10 19:45:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-02-10 19:45:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 462 transitions. [2020-02-10 19:45:49,081 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 462 transitions. Word has length 19 [2020-02-10 19:45:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,081 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 462 transitions. [2020-02-10 19:45:49,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 462 transitions. [2020-02-10 19:45:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:49,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:49,082 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,082 INFO L82 PathProgramCache]: Analyzing trace with hash -660301798, now seen corresponding path program 416 times [2020-02-10 19:45:49,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328916045] [2020-02-10 19:45:49,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,278 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:45:49,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328916045] [2020-02-10 19:45:49,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:49,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865464914] [2020-02-10 19:45:49,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:49,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:49,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:49,280 INFO L87 Difference]: Start difference. First operand 165 states and 462 transitions. Second operand 8 states. [2020-02-10 19:45:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,354 INFO L93 Difference]: Finished difference Result 297 states and 704 transitions. [2020-02-10 19:45:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:49,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,355 INFO L225 Difference]: With dead ends: 297 [2020-02-10 19:45:49,355 INFO L226 Difference]: Without dead ends: 275 [2020-02-10 19:45:49,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-02-10 19:45:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2020-02-10 19:45:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 19:45:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 442 transitions. [2020-02-10 19:45:49,359 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 442 transitions. Word has length 19 [2020-02-10 19:45:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,360 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 442 transitions. [2020-02-10 19:45:49,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 442 transitions. [2020-02-10 19:45:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:49,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:49,360 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:49,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,360 INFO L82 PathProgramCache]: Analyzing trace with hash -179159454, now seen corresponding path program 417 times [2020-02-10 19:45:49,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206839085] [2020-02-10 19:45:49,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,558 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:45:49,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206839085] [2020-02-10 19:45:49,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:49,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107849438] [2020-02-10 19:45:49,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:49,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:49,560 INFO L87 Difference]: Start difference. First operand 157 states and 442 transitions. Second operand 8 states. [2020-02-10 19:45:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,618 INFO L93 Difference]: Finished difference Result 286 states and 682 transitions. [2020-02-10 19:45:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:49,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,619 INFO L225 Difference]: With dead ends: 286 [2020-02-10 19:45:49,619 INFO L226 Difference]: Without dead ends: 270 [2020-02-10 19:45:49,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-02-10 19:45:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 162. [2020-02-10 19:45:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-02-10 19:45:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 451 transitions. [2020-02-10 19:45:49,624 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 451 transitions. Word has length 19 [2020-02-10 19:45:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,624 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 451 transitions. [2020-02-10 19:45:49,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 451 transitions. [2020-02-10 19:45:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:49,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:49,624 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash -930221548, now seen corresponding path program 418 times [2020-02-10 19:45:49,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479942923] [2020-02-10 19:45:49,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,817 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:45:49,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479942923] [2020-02-10 19:45:49,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:49,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248993549] [2020-02-10 19:45:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:49,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:49,818 INFO L87 Difference]: Start difference. First operand 162 states and 451 transitions. Second operand 8 states. [2020-02-10 19:45:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,896 INFO L93 Difference]: Finished difference Result 273 states and 661 transitions. [2020-02-10 19:45:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:49,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,897 INFO L225 Difference]: With dead ends: 273 [2020-02-10 19:45:49,897 INFO L226 Difference]: Without dead ends: 256 [2020-02-10 19:45:49,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-02-10 19:45:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2020-02-10 19:45:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 19:45:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-02-10 19:45:49,901 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-02-10 19:45:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,901 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-02-10 19:45:49,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-02-10 19:45:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:49,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:49,902 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2094625272, now seen corresponding path program 419 times [2020-02-10 19:45:49,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595814363] [2020-02-10 19:45:49,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,091 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:45:50,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595814363] [2020-02-10 19:45:50,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:50,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053799588] [2020-02-10 19:45:50,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:50,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:50,093 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-02-10 19:45:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,168 INFO L93 Difference]: Finished difference Result 283 states and 672 transitions. [2020-02-10 19:45:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:50,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,169 INFO L225 Difference]: With dead ends: 283 [2020-02-10 19:45:50,169 INFO L226 Difference]: Without dead ends: 269 [2020-02-10 19:45:50,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-02-10 19:45:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 161. [2020-02-10 19:45:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-02-10 19:45:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 445 transitions. [2020-02-10 19:45:50,173 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 445 transitions. Word has length 19 [2020-02-10 19:45:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,173 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 445 transitions. [2020-02-10 19:45:50,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 445 transitions. [2020-02-10 19:45:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:50,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:50,174 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2094030626, now seen corresponding path program 420 times [2020-02-10 19:45:50,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608792214] [2020-02-10 19:45:50,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,362 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:45:50,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608792214] [2020-02-10 19:45:50,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:50,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148932357] [2020-02-10 19:45:50,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:50,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:50,364 INFO L87 Difference]: Start difference. First operand 161 states and 445 transitions. Second operand 8 states. [2020-02-10 19:45:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,439 INFO L93 Difference]: Finished difference Result 272 states and 655 transitions. [2020-02-10 19:45:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:50,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,440 INFO L225 Difference]: With dead ends: 272 [2020-02-10 19:45:50,440 INFO L226 Difference]: Without dead ends: 250 [2020-02-10 19:45:50,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-02-10 19:45:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 151. [2020-02-10 19:45:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:45:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 423 transitions. [2020-02-10 19:45:50,445 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 423 transitions. Word has length 19 [2020-02-10 19:45:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,445 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 423 transitions. [2020-02-10 19:45:50,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 423 transitions. [2020-02-10 19:45:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:50,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:50,446 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash 677525702, now seen corresponding path program 421 times [2020-02-10 19:45:50,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542337334] [2020-02-10 19:45:50,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,638 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:45:50,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542337334] [2020-02-10 19:45:50,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:50,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885735657] [2020-02-10 19:45:50,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:50,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:50,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:50,639 INFO L87 Difference]: Start difference. First operand 151 states and 423 transitions. Second operand 8 states. [2020-02-10 19:45:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,700 INFO L93 Difference]: Finished difference Result 273 states and 645 transitions. [2020-02-10 19:45:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:50,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,701 INFO L225 Difference]: With dead ends: 273 [2020-02-10 19:45:50,701 INFO L226 Difference]: Without dead ends: 257 [2020-02-10 19:45:50,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-02-10 19:45:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2020-02-10 19:45:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 19:45:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-02-10 19:45:50,705 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-02-10 19:45:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,705 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-02-10 19:45:50,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-02-10 19:45:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:50,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:50,706 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash 936583928, now seen corresponding path program 422 times [2020-02-10 19:45:50,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482944299] [2020-02-10 19:45:50,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,896 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:45:50,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482944299] [2020-02-10 19:45:50,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750379861] [2020-02-10 19:45:50,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:50,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:50,897 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-02-10 19:45:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,961 INFO L93 Difference]: Finished difference Result 267 states and 630 transitions. [2020-02-10 19:45:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:50,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,961 INFO L225 Difference]: With dead ends: 267 [2020-02-10 19:45:50,961 INFO L226 Difference]: Without dead ends: 254 [2020-02-10 19:45:50,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-02-10 19:45:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154. [2020-02-10 19:45:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:45:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-02-10 19:45:50,966 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-02-10 19:45:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,966 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-02-10 19:45:50,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-02-10 19:45:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:50,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:50,967 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash -922912152, now seen corresponding path program 423 times [2020-02-10 19:45:50,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993346195] [2020-02-10 19:45:50,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,171 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:45:51,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993346195] [2020-02-10 19:45:51,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:51,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852830050] [2020-02-10 19:45:51,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:51,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:51,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:51,173 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-02-10 19:45:51,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,234 INFO L93 Difference]: Finished difference Result 264 states and 625 transitions. [2020-02-10 19:45:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:51,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,236 INFO L225 Difference]: With dead ends: 264 [2020-02-10 19:45:51,236 INFO L226 Difference]: Without dead ends: 248 [2020-02-10 19:45:51,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-02-10 19:45:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 159. [2020-02-10 19:45:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-02-10 19:45:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 439 transitions. [2020-02-10 19:45:51,240 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 439 transitions. Word has length 19 [2020-02-10 19:45:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,240 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 439 transitions. [2020-02-10 19:45:51,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 439 transitions. [2020-02-10 19:45:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:51,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:51,241 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1673974246, now seen corresponding path program 424 times [2020-02-10 19:45:51,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34707599] [2020-02-10 19:45:51,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,441 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:45:51,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34707599] [2020-02-10 19:45:51,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:51,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189005209] [2020-02-10 19:45:51,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:51,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:51,443 INFO L87 Difference]: Start difference. First operand 159 states and 439 transitions. Second operand 8 states. [2020-02-10 19:45:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,523 INFO L93 Difference]: Finished difference Result 251 states and 604 transitions. [2020-02-10 19:45:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:51,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,524 INFO L225 Difference]: With dead ends: 251 [2020-02-10 19:45:51,524 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 19:45:51,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 19:45:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154. [2020-02-10 19:45:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:45:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 427 transitions. [2020-02-10 19:45:51,530 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 427 transitions. Word has length 19 [2020-02-10 19:45:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,530 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 427 transitions. [2020-02-10 19:45:51,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 427 transitions. [2020-02-10 19:45:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:51,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:51,531 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:51,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash -522490524, now seen corresponding path program 425 times [2020-02-10 19:45:51,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798796467] [2020-02-10 19:45:51,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,738 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:45:51,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798796467] [2020-02-10 19:45:51,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:51,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976132096] [2020-02-10 19:45:51,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:51,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:51,740 INFO L87 Difference]: Start difference. First operand 154 states and 427 transitions. Second operand 8 states. [2020-02-10 19:45:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,803 INFO L93 Difference]: Finished difference Result 246 states and 592 transitions. [2020-02-10 19:45:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:51,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,805 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:45:51,805 INFO L226 Difference]: Without dead ends: 236 [2020-02-10 19:45:51,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-02-10 19:45:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2020-02-10 19:45:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-02-10 19:45:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 430 transitions. [2020-02-10 19:45:51,809 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 430 transitions. Word has length 19 [2020-02-10 19:45:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,809 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 430 transitions. [2020-02-10 19:45:51,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 430 transitions. [2020-02-10 19:45:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:51,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:51,810 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1377797178, now seen corresponding path program 426 times [2020-02-10 19:45:51,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665042232] [2020-02-10 19:45:51,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,005 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:45:52,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665042232] [2020-02-10 19:45:52,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:52,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766625155] [2020-02-10 19:45:52,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:52,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:52,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:52,007 INFO L87 Difference]: Start difference. First operand 156 states and 430 transitions. Second operand 8 states. [2020-02-10 19:45:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,089 INFO L93 Difference]: Finished difference Result 235 states and 578 transitions. [2020-02-10 19:45:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:52,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,091 INFO L225 Difference]: With dead ends: 235 [2020-02-10 19:45:52,091 INFO L226 Difference]: Without dead ends: 218 [2020-02-10 19:45:52,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-02-10 19:45:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 151. [2020-02-10 19:45:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:45:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-02-10 19:45:52,097 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-02-10 19:45:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,097 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-02-10 19:45:52,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-02-10 19:45:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:52,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:52,098 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,098 INFO L82 PathProgramCache]: Analyzing trace with hash -722039428, now seen corresponding path program 427 times [2020-02-10 19:45:52,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115227774] [2020-02-10 19:45:52,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,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:45:52,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115227774] [2020-02-10 19:45:52,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:52,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903832496] [2020-02-10 19:45:52,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:52,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:52,275 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-02-10 19:45:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,350 INFO L93 Difference]: Finished difference Result 266 states and 629 transitions. [2020-02-10 19:45:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:52,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,351 INFO L225 Difference]: With dead ends: 266 [2020-02-10 19:45:52,351 INFO L226 Difference]: Without dead ends: 252 [2020-02-10 19:45:52,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-02-10 19:45:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 155. [2020-02-10 19:45:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 19:45:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-02-10 19:45:52,356 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-02-10 19:45:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,356 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-02-10 19:45:52,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-02-10 19:45:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:52,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:52,357 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 398090402, now seen corresponding path program 428 times [2020-02-10 19:45:52,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845821161] [2020-02-10 19:45:52,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,549 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:45:52,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845821161] [2020-02-10 19:45:52,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:52,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599447595] [2020-02-10 19:45:52,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:52,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:52,551 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-02-10 19:45:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,614 INFO L93 Difference]: Finished difference Result 262 states and 618 transitions. [2020-02-10 19:45:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:52,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,615 INFO L225 Difference]: With dead ends: 262 [2020-02-10 19:45:52,616 INFO L226 Difference]: Without dead ends: 250 [2020-02-10 19:45:52,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-02-10 19:45:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 153. [2020-02-10 19:45:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-02-10 19:45:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 425 transitions. [2020-02-10 19:45:52,620 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 425 transitions. Word has length 19 [2020-02-10 19:45:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,621 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 425 transitions. [2020-02-10 19:45:52,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 425 transitions. [2020-02-10 19:45:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:52,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:52,621 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1466741926, now seen corresponding path program 429 times [2020-02-10 19:45:52,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128238958] [2020-02-10 19:45:52,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,799 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:45:52,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128238958] [2020-02-10 19:45:52,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:52,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029233891] [2020-02-10 19:45:52,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:52,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:52,800 INFO L87 Difference]: Start difference. First operand 153 states and 425 transitions. Second operand 8 states. [2020-02-10 19:45:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,876 INFO L93 Difference]: Finished difference Result 260 states and 615 transitions. [2020-02-10 19:45:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:52,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,877 INFO L225 Difference]: With dead ends: 260 [2020-02-10 19:45:52,877 INFO L226 Difference]: Without dead ends: 246 [2020-02-10 19:45:52,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-02-10 19:45:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 157. [2020-02-10 19:45:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 19:45:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 433 transitions. [2020-02-10 19:45:52,881 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 433 transitions. Word has length 19 [2020-02-10 19:45:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,881 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 433 transitions. [2020-02-10 19:45:52,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 433 transitions. [2020-02-10 19:45:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:52,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:52,882 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2082928226, now seen corresponding path program 430 times [2020-02-10 19:45:52,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425652978] [2020-02-10 19:45:52,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,068 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:45:53,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425652978] [2020-02-10 19:45:53,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:53,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496491766] [2020-02-10 19:45:53,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:53,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:53,069 INFO L87 Difference]: Start difference. First operand 157 states and 433 transitions. Second operand 8 states. [2020-02-10 19:45:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,145 INFO L93 Difference]: Finished difference Result 249 states and 598 transitions. [2020-02-10 19:45:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:53,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,146 INFO L225 Difference]: With dead ends: 249 [2020-02-10 19:45:53,146 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 19:45:53,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 19:45:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 153. [2020-02-10 19:45:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-02-10 19:45:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 423 transitions. [2020-02-10 19:45:53,150 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 423 transitions. Word has length 19 [2020-02-10 19:45:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,150 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 423 transitions. [2020-02-10 19:45:53,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 423 transitions. [2020-02-10 19:45:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:53,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:53,150 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash -137139400, now seen corresponding path program 431 times [2020-02-10 19:45:53,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057646009] [2020-02-10 19:45:53,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,335 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:45:53,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057646009] [2020-02-10 19:45:53,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:53,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201418302] [2020-02-10 19:45:53,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:53,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:53,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:53,337 INFO L87 Difference]: Start difference. First operand 153 states and 423 transitions. Second operand 8 states. [2020-02-10 19:45:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,400 INFO L93 Difference]: Finished difference Result 245 states and 588 transitions. [2020-02-10 19:45:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:53,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,401 INFO L225 Difference]: With dead ends: 245 [2020-02-10 19:45:53,401 INFO L226 Difference]: Without dead ends: 235 [2020-02-10 19:45:53,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-02-10 19:45:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 155. [2020-02-10 19:45:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 19:45:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 426 transitions. [2020-02-10 19:45:53,405 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 426 transitions. Word has length 19 [2020-02-10 19:45:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,405 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 426 transitions. [2020-02-10 19:45:53,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 426 transitions. [2020-02-10 19:45:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:53,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:53,406 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:53,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash -992446054, now seen corresponding path program 432 times [2020-02-10 19:45:53,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829916077] [2020-02-10 19:45:53,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,588 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:45:53,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829916077] [2020-02-10 19:45:53,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:53,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223146864] [2020-02-10 19:45:53,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:53,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:53,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:53,589 INFO L87 Difference]: Start difference. First operand 155 states and 426 transitions. Second operand 8 states. [2020-02-10 19:45:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,665 INFO L93 Difference]: Finished difference Result 234 states and 574 transitions. [2020-02-10 19:45:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:53,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,666 INFO L225 Difference]: With dead ends: 234 [2020-02-10 19:45:53,666 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 19:45:53,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 19:45:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 147. [2020-02-10 19:45:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:45:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 412 transitions. [2020-02-10 19:45:53,670 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 412 transitions. Word has length 19 [2020-02-10 19:45:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,670 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 412 transitions. [2020-02-10 19:45:53,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 412 transitions. [2020-02-10 19:45:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:53,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:53,671 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:53,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1774006882, now seen corresponding path program 433 times [2020-02-10 19:45:53,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809582217] [2020-02-10 19:45:53,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,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:45:53,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809582217] [2020-02-10 19:45:53,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:53,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874139909] [2020-02-10 19:45:53,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:53,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:53,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:53,874 INFO L87 Difference]: Start difference. First operand 147 states and 412 transitions. Second operand 8 states. [2020-02-10 19:45:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,935 INFO L93 Difference]: Finished difference Result 260 states and 610 transitions. [2020-02-10 19:45:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:53,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,936 INFO L225 Difference]: With dead ends: 260 [2020-02-10 19:45:53,936 INFO L226 Difference]: Without dead ends: 244 [2020-02-10 19:45:53,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-02-10 19:45:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-02-10 19:45:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:45:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-02-10 19:45:53,940 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-02-10 19:45:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,941 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-02-10 19:45:53,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-02-10 19:45:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:53,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:53,941 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash -377719664, now seen corresponding path program 434 times [2020-02-10 19:45:53,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711571701] [2020-02-10 19:45:53,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,135 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:45:54,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711571701] [2020-02-10 19:45:54,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:54,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455056539] [2020-02-10 19:45:54,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:54,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:54,137 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-02-10 19:45:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,214 INFO L93 Difference]: Finished difference Result 254 states and 595 transitions. [2020-02-10 19:45:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:54,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,215 INFO L225 Difference]: With dead ends: 254 [2020-02-10 19:45:54,215 INFO L226 Difference]: Without dead ends: 241 [2020-02-10 19:45:54,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-02-10 19:45:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-02-10 19:45:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:45:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 424 transitions. [2020-02-10 19:45:54,219 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 424 transitions. Word has length 19 [2020-02-10 19:45:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,219 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 424 transitions. [2020-02-10 19:45:54,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 424 transitions. [2020-02-10 19:45:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:54,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:54,220 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash 173569028, now seen corresponding path program 435 times [2020-02-10 19:45:54,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99302722] [2020-02-10 19:45:54,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,421 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:45:54,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99302722] [2020-02-10 19:45:54,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:54,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200030654] [2020-02-10 19:45:54,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:54,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:54,423 INFO L87 Difference]: Start difference. First operand 151 states and 424 transitions. Second operand 8 states. [2020-02-10 19:45:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,476 INFO L93 Difference]: Finished difference Result 260 states and 608 transitions. [2020-02-10 19:45:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:54,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,477 INFO L225 Difference]: With dead ends: 260 [2020-02-10 19:45:54,477 INFO L226 Difference]: Without dead ends: 244 [2020-02-10 19:45:54,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-02-10 19:45:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-02-10 19:45:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:45:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 428 transitions. [2020-02-10 19:45:54,482 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 428 transitions. Word has length 19 [2020-02-10 19:45:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,482 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 428 transitions. [2020-02-10 19:45:54,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 428 transitions. [2020-02-10 19:45:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:54,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:54,483 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:54,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash 432627254, now seen corresponding path program 436 times [2020-02-10 19:45:54,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268767274] [2020-02-10 19:45:54,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,677 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:45:54,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268767274] [2020-02-10 19:45:54,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:54,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241264808] [2020-02-10 19:45:54,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:54,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:54,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:54,678 INFO L87 Difference]: Start difference. First operand 154 states and 428 transitions. Second operand 8 states. [2020-02-10 19:45:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,734 INFO L93 Difference]: Finished difference Result 254 states and 593 transitions. [2020-02-10 19:45:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:54,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,735 INFO L225 Difference]: With dead ends: 254 [2020-02-10 19:45:54,735 INFO L226 Difference]: Without dead ends: 241 [2020-02-10 19:45:54,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-02-10 19:45:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-02-10 19:45:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:45:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 422 transitions. [2020-02-10 19:45:54,739 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 422 transitions. Word has length 19 [2020-02-10 19:45:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,739 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 422 transitions. [2020-02-10 19:45:54,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 422 transitions. [2020-02-10 19:45:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:54,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:54,740 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash -807811068, now seen corresponding path program 437 times [2020-02-10 19:45:54,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800327301] [2020-02-10 19:45:54,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,948 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:45:54,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800327301] [2020-02-10 19:45:54,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:54,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778014576] [2020-02-10 19:45:54,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:54,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:54,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:54,949 INFO L87 Difference]: Start difference. First operand 151 states and 422 transitions. Second operand 8 states. [2020-02-10 19:45:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,029 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 19:45:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:55,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,030 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:45:55,030 INFO L226 Difference]: Without dead ends: 236 [2020-02-10 19:45:55,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-02-10 19:45:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 152. [2020-02-10 19:45:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:45:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 19:45:55,034 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 19:45:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,034 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 19:45:55,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 19:45:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:55,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:55,035 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1047453406, now seen corresponding path program 438 times [2020-02-10 19:45:55,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469685041] [2020-02-10 19:45:55,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,250 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:45:55,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469685041] [2020-02-10 19:45:55,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:55,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691369000] [2020-02-10 19:45:55,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:55,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:55,251 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 19:45:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,313 INFO L93 Difference]: Finished difference Result 246 states and 576 transitions. [2020-02-10 19:45:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:55,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,314 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:45:55,315 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 19:45:55,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 19:45:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 149. [2020-02-10 19:45:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:45:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 418 transitions. [2020-02-10 19:45:55,319 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 418 transitions. Word has length 19 [2020-02-10 19:45:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,319 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 418 transitions. [2020-02-10 19:45:55,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 418 transitions. [2020-02-10 19:45:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:55,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:55,320 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:55,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,320 INFO L82 PathProgramCache]: Analyzing trace with hash -594926336, now seen corresponding path program 439 times [2020-02-10 19:45:55,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790788471] [2020-02-10 19:45:55,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,519 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:45:55,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790788471] [2020-02-10 19:45:55,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:55,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237184609] [2020-02-10 19:45:55,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:55,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:55,520 INFO L87 Difference]: Start difference. First operand 149 states and 418 transitions. Second operand 8 states. [2020-02-10 19:45:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,576 INFO L93 Difference]: Finished difference Result 258 states and 603 transitions. [2020-02-10 19:45:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:55,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,577 INFO L225 Difference]: With dead ends: 258 [2020-02-10 19:45:55,577 INFO L226 Difference]: Without dead ends: 242 [2020-02-10 19:45:55,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-02-10 19:45:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 155. [2020-02-10 19:45:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 19:45:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 432 transitions. [2020-02-10 19:45:55,582 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 432 transitions. Word has length 19 [2020-02-10 19:45:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,582 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 432 transitions. [2020-02-10 19:45:55,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 432 transitions. [2020-02-10 19:45:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:55,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:55,582 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1548314414, now seen corresponding path program 440 times [2020-02-10 19:45:55,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178261183] [2020-02-10 19:45:55,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:55,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178261183] [2020-02-10 19:45:55,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:55,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970757223] [2020-02-10 19:45:55,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:55,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:55,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:55,790 INFO L87 Difference]: Start difference. First operand 155 states and 432 transitions. Second operand 8 states. [2020-02-10 19:45:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,868 INFO L93 Difference]: Finished difference Result 252 states and 588 transitions. [2020-02-10 19:45:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:55,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,870 INFO L225 Difference]: With dead ends: 252 [2020-02-10 19:45:55,870 INFO L226 Difference]: Without dead ends: 239 [2020-02-10 19:45:55,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-02-10 19:45:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 152. [2020-02-10 19:45:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:45:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 425 transitions. [2020-02-10 19:45:55,874 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 425 transitions. Word has length 19 [2020-02-10 19:45:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,874 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 425 transitions. [2020-02-10 19:45:55,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 425 transitions. [2020-02-10 19:45:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:55,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:55,875 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash 499165252, now seen corresponding path program 441 times [2020-02-10 19:45:55,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85775173] [2020-02-10 19:45:55,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,079 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:45:56,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85775173] [2020-02-10 19:45:56,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:56,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279568741] [2020-02-10 19:45:56,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:56,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:56,080 INFO L87 Difference]: Start difference. First operand 152 states and 425 transitions. Second operand 8 states. [2020-02-10 19:45:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,138 INFO L93 Difference]: Finished difference Result 254 states and 597 transitions. [2020-02-10 19:45:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:56,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,139 INFO L225 Difference]: With dead ends: 254 [2020-02-10 19:45:56,139 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 19:45:56,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 19:45:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2020-02-10 19:45:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 19:45:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 434 transitions. [2020-02-10 19:45:56,143 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 434 transitions. Word has length 19 [2020-02-10 19:45:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,143 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 434 transitions. [2020-02-10 19:45:56,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 434 transitions. [2020-02-10 19:45:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:56,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:56,144 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash -251896842, now seen corresponding path program 442 times [2020-02-10 19:45:56,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743477545] [2020-02-10 19:45:56,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:56,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743477545] [2020-02-10 19:45:56,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:56,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784020858] [2020-02-10 19:45:56,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:56,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:56,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:56,353 INFO L87 Difference]: Start difference. First operand 157 states and 434 transitions. Second operand 8 states. [2020-02-10 19:45:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,431 INFO L93 Difference]: Finished difference Result 241 states and 576 transitions. [2020-02-10 19:45:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:56,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,432 INFO L225 Difference]: With dead ends: 241 [2020-02-10 19:45:56,432 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 19:45:56,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 19:45:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2020-02-10 19:45:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:45:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-02-10 19:45:56,436 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-02-10 19:45:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,436 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-02-10 19:45:56,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-02-10 19:45:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:56,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:56,437 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash 908750314, now seen corresponding path program 443 times [2020-02-10 19:45:56,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538770396] [2020-02-10 19:45:56,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,640 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:45:56,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538770396] [2020-02-10 19:45:56,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:56,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666758895] [2020-02-10 19:45:56,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:56,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:56,641 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-02-10 19:45:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,724 INFO L93 Difference]: Finished difference Result 245 states and 573 transitions. [2020-02-10 19:45:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:56,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,725 INFO L225 Difference]: With dead ends: 245 [2020-02-10 19:45:56,725 INFO L226 Difference]: Without dead ends: 235 [2020-02-10 19:45:56,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-02-10 19:45:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 154. [2020-02-10 19:45:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:45:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-02-10 19:45:56,728 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-02-10 19:45:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,729 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-02-10 19:45:56,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-02-10 19:45:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:56,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,729 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:56,729 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1675603674, now seen corresponding path program 444 times [2020-02-10 19:45:56,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080192135] [2020-02-10 19:45:56,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:56,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080192135] [2020-02-10 19:45:56,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:56,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294717166] [2020-02-10 19:45:56,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:56,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:56,943 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-02-10 19:45:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,027 INFO L93 Difference]: Finished difference Result 238 states and 567 transitions. [2020-02-10 19:45:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:57,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,028 INFO L225 Difference]: With dead ends: 238 [2020-02-10 19:45:57,028 INFO L226 Difference]: Without dead ends: 221 [2020-02-10 19:45:57,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-02-10 19:45:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2020-02-10 19:45:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:45:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-02-10 19:45:57,032 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-02-10 19:45:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,032 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-02-10 19:45:57,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-02-10 19:45:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:57,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:57,032 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:57,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash -269330112, now seen corresponding path program 445 times [2020-02-10 19:45:57,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516207920] [2020-02-10 19:45:57,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:57,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516207920] [2020-02-10 19:45:57,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:57,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996940953] [2020-02-10 19:45:57,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:57,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:57,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:57,236 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-02-10 19:45:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,297 INFO L93 Difference]: Finished difference Result 244 states and 569 transitions. [2020-02-10 19:45:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:57,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,298 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:45:57,299 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 19:45:57,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 19:45:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 155. [2020-02-10 19:45:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-02-10 19:45:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-02-10 19:45:57,303 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-02-10 19:45:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,303 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-02-10 19:45:57,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-02-10 19:45:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:57,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:57,303 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash -10271886, now seen corresponding path program 446 times [2020-02-10 19:45:57,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883329282] [2020-02-10 19:45:57,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,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:45:57,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883329282] [2020-02-10 19:45:57,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:57,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936189607] [2020-02-10 19:45:57,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:57,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:57,506 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-02-10 19:45:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,562 INFO L93 Difference]: Finished difference Result 238 states and 554 transitions. [2020-02-10 19:45:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:57,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,564 INFO L225 Difference]: With dead ends: 238 [2020-02-10 19:45:57,564 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 19:45:57,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 19:45:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 152. [2020-02-10 19:45:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:45:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 19:45:57,568 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 19:45:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,568 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 19:45:57,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 19:45:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:57,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:57,569 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1869767966, now seen corresponding path program 447 times [2020-02-10 19:45:57,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165168274] [2020-02-10 19:45:57,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,782 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:45:57,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165168274] [2020-02-10 19:45:57,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:57,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410390126] [2020-02-10 19:45:57,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:57,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:57,784 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 19:45:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,839 INFO L93 Difference]: Finished difference Result 235 states and 549 transitions. [2020-02-10 19:45:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:57,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,840 INFO L225 Difference]: With dead ends: 235 [2020-02-10 19:45:57,840 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 19:45:57,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 19:45:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2020-02-10 19:45:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-02-10 19:45:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 432 transitions. [2020-02-10 19:45:57,843 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 432 transitions. Word has length 19 [2020-02-10 19:45:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,844 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 432 transitions. [2020-02-10 19:45:57,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 432 transitions. [2020-02-10 19:45:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:57,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:57,844 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1674137236, now seen corresponding path program 448 times [2020-02-10 19:45:57,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954701810] [2020-02-10 19:45:57,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,046 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:45:58,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954701810] [2020-02-10 19:45:58,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:58,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448054429] [2020-02-10 19:45:58,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:58,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:58,047 INFO L87 Difference]: Start difference. First operand 157 states and 432 transitions. Second operand 8 states. [2020-02-10 19:45:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,136 INFO L93 Difference]: Finished difference Result 222 states and 528 transitions. [2020-02-10 19:45:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:58,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,137 INFO L225 Difference]: With dead ends: 222 [2020-02-10 19:45:58,137 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 19:45:58,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 19:45:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-02-10 19:45:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:45:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 420 transitions. [2020-02-10 19:45:58,140 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 420 transitions. Word has length 19 [2020-02-10 19:45:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,140 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 420 transitions. [2020-02-10 19:45:58,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 420 transitions. [2020-02-10 19:45:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:58,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:58,141 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1469346338, now seen corresponding path program 449 times [2020-02-10 19:45:58,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399724569] [2020-02-10 19:45:58,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,354 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:45:58,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399724569] [2020-02-10 19:45:58,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:58,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895336877] [2020-02-10 19:45:58,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:58,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:58,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:58,355 INFO L87 Difference]: Start difference. First operand 152 states and 420 transitions. Second operand 8 states. [2020-02-10 19:45:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,411 INFO L93 Difference]: Finished difference Result 217 states and 516 transitions. [2020-02-10 19:45:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:58,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,412 INFO L225 Difference]: With dead ends: 217 [2020-02-10 19:45:58,412 INFO L226 Difference]: Without dead ends: 207 [2020-02-10 19:45:58,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-02-10 19:45:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 154. [2020-02-10 19:45:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:45:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 423 transitions. [2020-02-10 19:45:58,416 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 423 transitions. Word has length 19 [2020-02-10 19:45:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,417 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 423 transitions. [2020-02-10 19:45:58,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 423 transitions. [2020-02-10 19:45:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:58,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:58,417 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:58,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1970314304, now seen corresponding path program 450 times [2020-02-10 19:45:58,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589304639] [2020-02-10 19:45:58,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,620 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:45:58,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589304639] [2020-02-10 19:45:58,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:58,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091319303] [2020-02-10 19:45:58,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:58,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:58,622 INFO L87 Difference]: Start difference. First operand 154 states and 423 transitions. Second operand 8 states. [2020-02-10 19:45:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,697 INFO L93 Difference]: Finished difference Result 206 states and 502 transitions. [2020-02-10 19:45:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:58,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,698 INFO L225 Difference]: With dead ends: 206 [2020-02-10 19:45:58,698 INFO L226 Difference]: Without dead ends: 189 [2020-02-10 19:45:58,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-02-10 19:45:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-02-10 19:45:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:45:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-02-10 19:45:58,702 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-02-10 19:45:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,702 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-02-10 19:45:58,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-02-10 19:45:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:58,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:58,703 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1205521176, now seen corresponding path program 451 times [2020-02-10 19:45:58,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495219531] [2020-02-10 19:45:58,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,917 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:45:58,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495219531] [2020-02-10 19:45:58,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:58,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764634228] [2020-02-10 19:45:58,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:58,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:58,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:58,919 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-02-10 19:45:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,997 INFO L93 Difference]: Finished difference Result 214 states and 510 transitions. [2020-02-10 19:45:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:58,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:58,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,998 INFO L225 Difference]: With dead ends: 214 [2020-02-10 19:45:58,998 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 19:45:58,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 19:45:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 151. [2020-02-10 19:45:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:45:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 418 transitions. [2020-02-10 19:45:59,002 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 418 transitions. Word has length 19 [2020-02-10 19:45:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,002 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 418 transitions. [2020-02-10 19:45:59,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 418 transitions. [2020-02-10 19:45:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:59,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,003 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:59,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash 965878838, now seen corresponding path program 452 times [2020-02-10 19:45:59,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356554760] [2020-02-10 19:45:59,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:59,220 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:45:59,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356554760] [2020-02-10 19:45:59,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:59,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:59,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497568062] [2020-02-10 19:45:59,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:59,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:59,222 INFO L87 Difference]: Start difference. First operand 151 states and 418 transitions. Second operand 8 states. [2020-02-10 19:45:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,280 INFO L93 Difference]: Finished difference Result 214 states and 509 transitions. [2020-02-10 19:45:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:59,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,282 INFO L225 Difference]: With dead ends: 214 [2020-02-10 19:45:59,282 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 19:45:59,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 19:45:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 19:45:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:45:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 19:45:59,286 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 19:45:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,286 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 19:45:59,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 19:45:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:59,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,287 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash 460818678, now seen corresponding path program 453 times [2020-02-10 19:45:59,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498683396] [2020-02-10 19:45:59,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:59,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:45:59,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498683396] [2020-02-10 19:45:59,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:59,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:59,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087668839] [2020-02-10 19:45:59,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:59,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:59,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:59,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:59,496 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 19:45:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,572 INFO L93 Difference]: Finished difference Result 211 states and 504 transitions. [2020-02-10 19:45:59,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:59,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,573 INFO L225 Difference]: With dead ends: 211 [2020-02-10 19:45:59,573 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 19:45:59,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 19:45:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2020-02-10 19:45:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:45:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-02-10 19:45:59,577 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-02-10 19:45:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,577 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-02-10 19:45:59,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-02-10 19:45:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:59,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,577 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2123535310, now seen corresponding path program 454 times [2020-02-10 19:45:59,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957895304] [2020-02-10 19:45:59,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:59,809 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:45:59,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957895304] [2020-02-10 19:45:59,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:59,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:45:59,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758647184] [2020-02-10 19:45:59,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:45:59,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:45:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:45:59,810 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-02-10 19:45:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,886 INFO L93 Difference]: Finished difference Result 204 states and 498 transitions. [2020-02-10 19:45:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:45:59,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:45:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,887 INFO L225 Difference]: With dead ends: 204 [2020-02-10 19:45:59,887 INFO L226 Difference]: Without dead ends: 190 [2020-02-10 19:45:59,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:45:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-02-10 19:45:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2020-02-10 19:45:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:45:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 19:45:59,891 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 19:45:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,891 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 19:45:59,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:45:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 19:45:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:45:59,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,892 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash -107206542, now seen corresponding path program 455 times [2020-02-10 19:45:59,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886869869] [2020-02-10 19:45:59,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,106 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:46:00,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886869869] [2020-02-10 19:46:00,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:00,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099582843] [2020-02-10 19:46:00,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:00,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:00,108 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 19:46:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,163 INFO L93 Difference]: Finished difference Result 198 states and 486 transitions. [2020-02-10 19:46:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:00,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,164 INFO L225 Difference]: With dead ends: 198 [2020-02-10 19:46:00,164 INFO L226 Difference]: Without dead ends: 188 [2020-02-10 19:46:00,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-02-10 19:46:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2020-02-10 19:46:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:46:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 19:46:00,167 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 19:46:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,167 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 19:46:00,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 19:46:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:00,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:00,168 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -962513196, now seen corresponding path program 456 times [2020-02-10 19:46:00,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529101430] [2020-02-10 19:46:00,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,374 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:46:00,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529101430] [2020-02-10 19:46:00,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:00,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75958394] [2020-02-10 19:46:00,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:00,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:00,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:00,376 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 19:46:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,448 INFO L93 Difference]: Finished difference Result 187 states and 472 transitions. [2020-02-10 19:46:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:00,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,449 INFO L225 Difference]: With dead ends: 187 [2020-02-10 19:46:00,449 INFO L226 Difference]: Without dead ends: 170 [2020-02-10 19:46:00,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-02-10 19:46:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 147. [2020-02-10 19:46:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 410 transitions. [2020-02-10 19:46:00,453 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 410 transitions. Word has length 19 [2020-02-10 19:46:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,453 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 410 transitions. [2020-02-10 19:46:00,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 410 transitions. [2020-02-10 19:46:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:00,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:00,454 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash 915076246, now seen corresponding path program 457 times [2020-02-10 19:46:00,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065903344] [2020-02-10 19:46:00,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,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:46:00,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065903344] [2020-02-10 19:46:00,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:00,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080442659] [2020-02-10 19:46:00,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:00,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:00,645 INFO L87 Difference]: Start difference. First operand 147 states and 410 transitions. Second operand 8 states. [2020-02-10 19:46:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,726 INFO L93 Difference]: Finished difference Result 246 states and 578 transitions. [2020-02-10 19:46:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:00,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,727 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:46:00,727 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 19:46:00,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 19:46:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-02-10 19:46:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:46:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-02-10 19:46:00,730 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-02-10 19:46:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,730 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-02-10 19:46:00,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-02-10 19:46:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:00,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:00,731 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash 40740920, now seen corresponding path program 458 times [2020-02-10 19:46:00,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827755050] [2020-02-10 19:46:00,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,925 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:46:00,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827755050] [2020-02-10 19:46:00,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:00,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389246822] [2020-02-10 19:46:00,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:00,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:00,926 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-02-10 19:46:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,007 INFO L93 Difference]: Finished difference Result 242 states and 567 transitions. [2020-02-10 19:46:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:01,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,008 INFO L225 Difference]: With dead ends: 242 [2020-02-10 19:46:01,008 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 19:46:01,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 19:46:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-02-10 19:46:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-02-10 19:46:01,012 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-02-10 19:46:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,013 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-02-10 19:46:01,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-02-10 19:46:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:01,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:01,013 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2076098360, now seen corresponding path program 459 times [2020-02-10 19:46:01,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514041175] [2020-02-10 19:46:01,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,201 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:46:01,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514041175] [2020-02-10 19:46:01,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:01,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135077406] [2020-02-10 19:46:01,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:01,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:01,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:01,202 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-02-10 19:46:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,273 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 19:46:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:01,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,274 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:46:01,274 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 19:46:01,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 19:46:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-02-10 19:46:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:46:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 419 transitions. [2020-02-10 19:46:01,277 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 419 transitions. Word has length 19 [2020-02-10 19:46:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,277 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 419 transitions. [2020-02-10 19:46:01,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 419 transitions. [2020-02-10 19:46:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:01,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:01,278 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1098739106, now seen corresponding path program 460 times [2020-02-10 19:46:01,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969268295] [2020-02-10 19:46:01,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,478 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:46:01,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969268295] [2020-02-10 19:46:01,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:01,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815417480] [2020-02-10 19:46:01,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:01,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:01,479 INFO L87 Difference]: Start difference. First operand 151 states and 419 transitions. Second operand 8 states. [2020-02-10 19:46:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,543 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-02-10 19:46:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:01,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,544 INFO L225 Difference]: With dead ends: 242 [2020-02-10 19:46:01,544 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 19:46:01,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 19:46:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-02-10 19:46:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 415 transitions. [2020-02-10 19:46:01,549 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 415 transitions. Word has length 19 [2020-02-10 19:46:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,549 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 415 transitions. [2020-02-10 19:46:01,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 415 transitions. [2020-02-10 19:46:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:01,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:01,550 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,551 INFO L82 PathProgramCache]: Analyzing trace with hash -321241190, now seen corresponding path program 461 times [2020-02-10 19:46:01,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016992645] [2020-02-10 19:46:01,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,750 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:46:01,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016992645] [2020-02-10 19:46:01,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:01,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071419253] [2020-02-10 19:46:01,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:01,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:01,752 INFO L87 Difference]: Start difference. First operand 149 states and 415 transitions. Second operand 8 states. [2020-02-10 19:46:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,829 INFO L93 Difference]: Finished difference Result 237 states and 555 transitions. [2020-02-10 19:46:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:01,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,831 INFO L225 Difference]: With dead ends: 237 [2020-02-10 19:46:01,831 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 19:46:01,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 19:46:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 150. [2020-02-10 19:46:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 19:46:01,835 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 19:46:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,835 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 19:46:01,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 19:46:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:01,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:01,836 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,836 INFO L82 PathProgramCache]: Analyzing trace with hash -560883528, now seen corresponding path program 462 times [2020-02-10 19:46:01,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284922799] [2020-02-10 19:46:01,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,140 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:46:02,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284922799] [2020-02-10 19:46:02,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:02,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041372029] [2020-02-10 19:46:02,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:02,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:02,142 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 19:46:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,206 INFO L93 Difference]: Finished difference Result 237 states and 554 transitions. [2020-02-10 19:46:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:02,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,207 INFO L225 Difference]: With dead ends: 237 [2020-02-10 19:46:02,207 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 19:46:02,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 19:46:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 148. [2020-02-10 19:46:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 19:46:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 413 transitions. [2020-02-10 19:46:02,211 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 413 transitions. Word has length 19 [2020-02-10 19:46:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,211 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 413 transitions. [2020-02-10 19:46:02,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 413 transitions. [2020-02-10 19:46:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:02,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:02,212 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash -695864712, now seen corresponding path program 463 times [2020-02-10 19:46:02,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783299906] [2020-02-10 19:46:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:02,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783299906] [2020-02-10 19:46:02,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:02,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095113995] [2020-02-10 19:46:02,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:02,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:02,387 INFO L87 Difference]: Start difference. First operand 148 states and 413 transitions. Second operand 8 states. [2020-02-10 19:46:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,468 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-02-10 19:46:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:02,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,469 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:46:02,469 INFO L226 Difference]: Without dead ends: 232 [2020-02-10 19:46:02,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-02-10 19:46:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2020-02-10 19:46:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:46:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-02-10 19:46:02,473 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-02-10 19:46:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,473 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-02-10 19:46:02,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-02-10 19:46:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:02,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:02,474 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1570200038, now seen corresponding path program 464 times [2020-02-10 19:46:02,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807984177] [2020-02-10 19:46:02,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,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:46:02,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807984177] [2020-02-10 19:46:02,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:02,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321587903] [2020-02-10 19:46:02,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:02,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:02,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:02,650 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-02-10 19:46:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,729 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-02-10 19:46:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:02,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,730 INFO L225 Difference]: With dead ends: 242 [2020-02-10 19:46:02,730 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 19:46:02,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 19:46:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2020-02-10 19:46:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2020-02-10 19:46:02,738 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 19 [2020-02-10 19:46:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,738 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2020-02-10 19:46:02,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2020-02-10 19:46:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:02,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:02,738 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash 793540284, now seen corresponding path program 465 times [2020-02-10 19:46:02,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773772057] [2020-02-10 19:46:02,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,908 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:46:02,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773772057] [2020-02-10 19:46:02,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:02,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389451652] [2020-02-10 19:46:02,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:02,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:02,909 INFO L87 Difference]: Start difference. First operand 150 states and 418 transitions. Second operand 8 states. [2020-02-10 19:46:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,987 INFO L93 Difference]: Finished difference Result 244 states and 575 transitions. [2020-02-10 19:46:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:02,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,988 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:46:02,988 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 19:46:02,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 19:46:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 154. [2020-02-10 19:46:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:46:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 426 transitions. [2020-02-10 19:46:02,992 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 426 transitions. Word has length 19 [2020-02-10 19:46:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,992 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 426 transitions. [2020-02-10 19:46:02,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 426 transitions. [2020-02-10 19:46:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:02,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:02,993 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 48243140, now seen corresponding path program 466 times [2020-02-10 19:46:02,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104188822] [2020-02-10 19:46:02,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,166 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:46:03,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104188822] [2020-02-10 19:46:03,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:03,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689889557] [2020-02-10 19:46:03,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:03,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:03,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:03,167 INFO L87 Difference]: Start difference. First operand 154 states and 426 transitions. Second operand 8 states. [2020-02-10 19:46:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,243 INFO L93 Difference]: Finished difference Result 233 states and 558 transitions. [2020-02-10 19:46:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:03,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,245 INFO L225 Difference]: With dead ends: 233 [2020-02-10 19:46:03,245 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 19:46:03,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 19:46:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2020-02-10 19:46:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 19:46:03,249 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 19:46:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,249 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 19:46:03,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 19:46:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:03,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:03,250 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2141654844, now seen corresponding path program 467 times [2020-02-10 19:46:03,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463470701] [2020-02-10 19:46:03,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,433 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:46:03,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463470701] [2020-02-10 19:46:03,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:03,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920154292] [2020-02-10 19:46:03,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:03,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:03,434 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 19:46:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,511 INFO L93 Difference]: Finished difference Result 238 states and 557 transitions. [2020-02-10 19:46:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:03,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,512 INFO L225 Difference]: With dead ends: 238 [2020-02-10 19:46:03,512 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 19:46:03,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 19:46:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152. [2020-02-10 19:46:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:46:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-02-10 19:46:03,515 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-02-10 19:46:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,515 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-02-10 19:46:03,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-02-10 19:46:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:03,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:03,516 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash -431041536, now seen corresponding path program 468 times [2020-02-10 19:46:03,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770092071] [2020-02-10 19:46:03,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,698 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:46:03,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770092071] [2020-02-10 19:46:03,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:03,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76556818] [2020-02-10 19:46:03,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:03,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:03,699 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-02-10 19:46:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,785 INFO L93 Difference]: Finished difference Result 231 states and 551 transitions. [2020-02-10 19:46:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:03,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,786 INFO L225 Difference]: With dead ends: 231 [2020-02-10 19:46:03,786 INFO L226 Difference]: Without dead ends: 215 [2020-02-10 19:46:03,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-02-10 19:46:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 148. [2020-02-10 19:46:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 19:46:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 412 transitions. [2020-02-10 19:46:03,790 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 412 transitions. Word has length 19 [2020-02-10 19:46:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,790 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 412 transitions. [2020-02-10 19:46:03,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 412 transitions. [2020-02-10 19:46:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:03,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:03,791 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1124777348, now seen corresponding path program 469 times [2020-02-10 19:46:03,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218295303] [2020-02-10 19:46:03,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,959 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:46:03,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218295303] [2020-02-10 19:46:03,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:03,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98601691] [2020-02-10 19:46:03,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:03,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:03,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:03,961 INFO L87 Difference]: Start difference. First operand 148 states and 412 transitions. Second operand 8 states. [2020-02-10 19:46:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,032 INFO L93 Difference]: Finished difference Result 236 states and 552 transitions. [2020-02-10 19:46:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:04,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,033 INFO L225 Difference]: With dead ends: 236 [2020-02-10 19:46:04,033 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 19:46:04,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 19:46:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 152. [2020-02-10 19:46:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:46:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-02-10 19:46:04,037 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-02-10 19:46:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,038 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-02-10 19:46:04,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-02-10 19:46:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:04,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:04,038 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash -4647518, now seen corresponding path program 470 times [2020-02-10 19:46:04,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652393872] [2020-02-10 19:46:04,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,221 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:46:04,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652393872] [2020-02-10 19:46:04,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:04,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465534775] [2020-02-10 19:46:04,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:04,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:04,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:04,223 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-02-10 19:46:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,286 INFO L93 Difference]: Finished difference Result 232 states and 541 transitions. [2020-02-10 19:46:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:04,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,287 INFO L225 Difference]: With dead ends: 232 [2020-02-10 19:46:04,287 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 19:46:04,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 19:46:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2020-02-10 19:46:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 417 transitions. [2020-02-10 19:46:04,291 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 417 transitions. Word has length 19 [2020-02-10 19:46:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,291 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 417 transitions. [2020-02-10 19:46:04,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 417 transitions. [2020-02-10 19:46:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:04,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:04,292 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1869479846, now seen corresponding path program 471 times [2020-02-10 19:46:04,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214200442] [2020-02-10 19:46:04,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,463 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:46:04,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214200442] [2020-02-10 19:46:04,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:04,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084029399] [2020-02-10 19:46:04,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:04,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:04,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:04,464 INFO L87 Difference]: Start difference. First operand 150 states and 417 transitions. Second operand 8 states. [2020-02-10 19:46:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,539 INFO L93 Difference]: Finished difference Result 230 states and 538 transitions. [2020-02-10 19:46:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:04,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,540 INFO L225 Difference]: With dead ends: 230 [2020-02-10 19:46:04,540 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 19:46:04,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 19:46:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 154. [2020-02-10 19:46:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-02-10 19:46:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-02-10 19:46:04,544 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-02-10 19:46:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,544 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-02-10 19:46:04,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-02-10 19:46:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:04,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:04,545 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1680190306, now seen corresponding path program 472 times [2020-02-10 19:46:04,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694816232] [2020-02-10 19:46:04,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,722 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:46:04,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694816232] [2020-02-10 19:46:04,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:04,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117859116] [2020-02-10 19:46:04,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:04,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:04,724 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-02-10 19:46:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,805 INFO L93 Difference]: Finished difference Result 219 states and 521 transitions. [2020-02-10 19:46:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:04,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,806 INFO L225 Difference]: With dead ends: 219 [2020-02-10 19:46:04,806 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 19:46:04,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 19:46:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 19:46:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 19:46:04,810 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 19:46:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,810 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 19:46:04,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 19:46:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:04,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:04,811 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,811 INFO L82 PathProgramCache]: Analyzing trace with hash -539877320, now seen corresponding path program 473 times [2020-02-10 19:46:04,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293369963] [2020-02-10 19:46:04,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,996 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:46:04,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293369963] [2020-02-10 19:46:04,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:04,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358326661] [2020-02-10 19:46:04,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:04,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:04,997 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 19:46:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,062 INFO L93 Difference]: Finished difference Result 215 states and 511 transitions. [2020-02-10 19:46:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:05,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,063 INFO L225 Difference]: With dead ends: 215 [2020-02-10 19:46:05,063 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 19:46:05,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 19:46:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-02-10 19:46:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:46:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 19:46:05,067 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 19:46:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,067 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 19:46:05,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 19:46:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:05,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:05,068 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1395183974, now seen corresponding path program 474 times [2020-02-10 19:46:05,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987974011] [2020-02-10 19:46:05,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:05,243 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:46:05,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987974011] [2020-02-10 19:46:05,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:05,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487923639] [2020-02-10 19:46:05,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:05,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:05,245 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 19:46:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,319 INFO L93 Difference]: Finished difference Result 204 states and 497 transitions. [2020-02-10 19:46:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:05,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,320 INFO L225 Difference]: With dead ends: 204 [2020-02-10 19:46:05,321 INFO L226 Difference]: Without dead ends: 188 [2020-02-10 19:46:05,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-02-10 19:46:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 148. [2020-02-10 19:46:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-02-10 19:46:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 411 transitions. [2020-02-10 19:46:05,324 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 411 transitions. Word has length 19 [2020-02-10 19:46:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,324 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 411 transitions. [2020-02-10 19:46:05,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 411 transitions. [2020-02-10 19:46:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:05,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:05,325 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash 266504132, now seen corresponding path program 475 times [2020-02-10 19:46:05,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128369632] [2020-02-10 19:46:05,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:05,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128369632] [2020-02-10 19:46:05,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:05,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405062865] [2020-02-10 19:46:05,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:05,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:05,531 INFO L87 Difference]: Start difference. First operand 148 states and 411 transitions. Second operand 8 states. [2020-02-10 19:46:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,627 INFO L93 Difference]: Finished difference Result 213 states and 507 transitions. [2020-02-10 19:46:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:05,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,628 INFO L225 Difference]: With dead ends: 213 [2020-02-10 19:46:05,628 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 19:46:05,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 19:46:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-02-10 19:46:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-02-10 19:46:05,632 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-02-10 19:46:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,632 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-02-10 19:46:05,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-02-10 19:46:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:05,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:05,633 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 26861794, now seen corresponding path program 476 times [2020-02-10 19:46:05,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384200395] [2020-02-10 19:46:05,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:05,838 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:46:05,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384200395] [2020-02-10 19:46:05,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:05,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465233824] [2020-02-10 19:46:05,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:05,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:05,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:05,840 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-02-10 19:46:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,902 INFO L93 Difference]: Finished difference Result 213 states and 506 transitions. [2020-02-10 19:46:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:05,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,903 INFO L225 Difference]: With dead ends: 213 [2020-02-10 19:46:05,903 INFO L226 Difference]: Without dead ends: 202 [2020-02-10 19:46:05,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-02-10 19:46:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2020-02-10 19:46:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 413 transitions. [2020-02-10 19:46:05,907 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 413 transitions. Word has length 19 [2020-02-10 19:46:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,908 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 413 transitions. [2020-02-10 19:46:05,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 413 transitions. [2020-02-10 19:46:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:05,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:05,908 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -478198366, now seen corresponding path program 477 times [2020-02-10 19:46:05,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916389890] [2020-02-10 19:46:05,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,105 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:46:06,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916389890] [2020-02-10 19:46:06,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:06,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359912188] [2020-02-10 19:46:06,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:06,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:06,106 INFO L87 Difference]: Start difference. First operand 149 states and 413 transitions. Second operand 8 states. [2020-02-10 19:46:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,182 INFO L93 Difference]: Finished difference Result 210 states and 501 transitions. [2020-02-10 19:46:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:06,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,183 INFO L225 Difference]: With dead ends: 210 [2020-02-10 19:46:06,183 INFO L226 Difference]: Without dead ends: 200 [2020-02-10 19:46:06,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-02-10 19:46:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2020-02-10 19:46:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:46:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 416 transitions. [2020-02-10 19:46:06,187 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 416 transitions. Word has length 19 [2020-02-10 19:46:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,187 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 416 transitions. [2020-02-10 19:46:06,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 416 transitions. [2020-02-10 19:46:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:06,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:06,188 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1232414942, now seen corresponding path program 478 times [2020-02-10 19:46:06,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619684204] [2020-02-10 19:46:06,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,384 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:46:06,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619684204] [2020-02-10 19:46:06,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:06,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513012331] [2020-02-10 19:46:06,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:06,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:06,385 INFO L87 Difference]: Start difference. First operand 151 states and 416 transitions. Second operand 8 states. [2020-02-10 19:46:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,464 INFO L93 Difference]: Finished difference Result 203 states and 495 transitions. [2020-02-10 19:46:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:06,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,465 INFO L225 Difference]: With dead ends: 203 [2020-02-10 19:46:06,466 INFO L226 Difference]: Without dead ends: 189 [2020-02-10 19:46:06,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-02-10 19:46:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-02-10 19:46:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-02-10 19:46:06,469 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-02-10 19:46:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,469 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-02-10 19:46:06,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-02-10 19:46:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:06,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:06,470 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:06,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1046223586, now seen corresponding path program 479 times [2020-02-10 19:46:06,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262404841] [2020-02-10 19:46:06,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,679 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:46:06,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262404841] [2020-02-10 19:46:06,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:06,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743680079] [2020-02-10 19:46:06,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:06,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:06,681 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-02-10 19:46:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,743 INFO L93 Difference]: Finished difference Result 197 states and 483 transitions. [2020-02-10 19:46:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:06,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,744 INFO L225 Difference]: With dead ends: 197 [2020-02-10 19:46:06,745 INFO L226 Difference]: Without dead ends: 187 [2020-02-10 19:46:06,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-02-10 19:46:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2020-02-10 19:46:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-02-10 19:46:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 415 transitions. [2020-02-10 19:46:06,748 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 415 transitions. Word has length 19 [2020-02-10 19:46:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,748 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 415 transitions. [2020-02-10 19:46:06,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 415 transitions. [2020-02-10 19:46:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:06,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:06,749 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1901530240, now seen corresponding path program 480 times [2020-02-10 19:46:06,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604264013] [2020-02-10 19:46:06,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,939 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:46:06,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604264013] [2020-02-10 19:46:06,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:06,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277929830] [2020-02-10 19:46:06,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:06,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:06,940 INFO L87 Difference]: Start difference. First operand 151 states and 415 transitions. Second operand 8 states. [2020-02-10 19:46:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,010 INFO L93 Difference]: Finished difference Result 186 states and 469 transitions. [2020-02-10 19:46:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:07,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,011 INFO L225 Difference]: With dead ends: 186 [2020-02-10 19:46:07,011 INFO L226 Difference]: Without dead ends: 167 [2020-02-10 19:46:07,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-02-10 19:46:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2020-02-10 19:46:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 19:46:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 404 transitions. [2020-02-10 19:46:07,014 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 404 transitions. Word has length 19 [2020-02-10 19:46:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,014 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 404 transitions. [2020-02-10 19:46:07,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 404 transitions. [2020-02-10 19:46:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:07,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,015 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash -700822424, now seen corresponding path program 481 times [2020-02-10 19:46:07,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573322441] [2020-02-10 19:46:07,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:07,225 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:46:07,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573322441] [2020-02-10 19:46:07,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:07,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:07,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419255189] [2020-02-10 19:46:07,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:07,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:07,226 INFO L87 Difference]: Start difference. First operand 144 states and 404 transitions. Second operand 8 states. [2020-02-10 19:46:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,285 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 19:46:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:07,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:07,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,286 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:46:07,286 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 19:46:07,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 19:46:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 19:46:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-02-10 19:46:07,290 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-02-10 19:46:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,291 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-02-10 19:46:07,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-02-10 19:46:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:07,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,291 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1442418326, now seen corresponding path program 482 times [2020-02-10 19:46:07,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528280567] [2020-02-10 19:46:07,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:07,498 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:46:07,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528280567] [2020-02-10 19:46:07,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:07,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:07,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710213834] [2020-02-10 19:46:07,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:07,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:07,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:07,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:07,499 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-02-10 19:46:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,577 INFO L93 Difference]: Finished difference Result 238 states and 545 transitions. [2020-02-10 19:46:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:07,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,578 INFO L225 Difference]: With dead ends: 238 [2020-02-10 19:46:07,578 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 19:46:07,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 19:46:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-02-10 19:46:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 19:46:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 408 transitions. [2020-02-10 19:46:07,581 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 408 transitions. Word has length 19 [2020-02-10 19:46:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,581 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 408 transitions. [2020-02-10 19:46:07,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 408 transitions. [2020-02-10 19:46:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:07,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,582 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1993707018, now seen corresponding path program 483 times [2020-02-10 19:46:07,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297232093] [2020-02-10 19:46:07,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:07,787 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:46:07,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297232093] [2020-02-10 19:46:07,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:07,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:07,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841917726] [2020-02-10 19:46:07,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:07,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:07,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:07,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:07,788 INFO L87 Difference]: Start difference. First operand 146 states and 408 transitions. Second operand 8 states. [2020-02-10 19:46:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,844 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-02-10 19:46:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:07,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,846 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:46:07,846 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 19:46:07,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 19:46:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 19:46:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-02-10 19:46:07,850 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-02-10 19:46:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,850 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-02-10 19:46:07,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-02-10 19:46:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:07,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,850 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2042202052, now seen corresponding path program 484 times [2020-02-10 19:46:07,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969074354] [2020-02-10 19:46:07,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,051 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:46:08,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969074354] [2020-02-10 19:46:08,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:08,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436770750] [2020-02-10 19:46:08,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:08,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:08,053 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-02-10 19:46:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,114 INFO L93 Difference]: Finished difference Result 238 states and 543 transitions. [2020-02-10 19:46:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:08,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,115 INFO L225 Difference]: With dead ends: 238 [2020-02-10 19:46:08,115 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 19:46:08,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 19:46:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-02-10 19:46:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 19:46:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 406 transitions. [2020-02-10 19:46:08,118 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 406 transitions. Word has length 19 [2020-02-10 19:46:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,118 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 406 transitions. [2020-02-10 19:46:08,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 406 transitions. [2020-02-10 19:46:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:08,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,119 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1012326922, now seen corresponding path program 485 times [2020-02-10 19:46:08,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002092356] [2020-02-10 19:46:08,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,334 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:46:08,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002092356] [2020-02-10 19:46:08,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:08,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262836195] [2020-02-10 19:46:08,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:08,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:08,339 INFO L87 Difference]: Start difference. First operand 146 states and 406 transitions. Second operand 8 states. [2020-02-10 19:46:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,418 INFO L93 Difference]: Finished difference Result 230 states and 527 transitions. [2020-02-10 19:46:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:08,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,419 INFO L225 Difference]: With dead ends: 230 [2020-02-10 19:46:08,419 INFO L226 Difference]: Without dead ends: 220 [2020-02-10 19:46:08,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-02-10 19:46:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 147. [2020-02-10 19:46:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-02-10 19:46:08,423 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-02-10 19:46:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,423 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-02-10 19:46:08,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-02-10 19:46:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:08,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,423 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,424 INFO L82 PathProgramCache]: Analyzing trace with hash 772684584, now seen corresponding path program 486 times [2020-02-10 19:46:08,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699581445] [2020-02-10 19:46:08,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,640 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:46:08,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699581445] [2020-02-10 19:46:08,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:08,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538087621] [2020-02-10 19:46:08,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:08,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:08,642 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-02-10 19:46:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,704 INFO L93 Difference]: Finished difference Result 230 states and 526 transitions. [2020-02-10 19:46:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:08,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,705 INFO L225 Difference]: With dead ends: 230 [2020-02-10 19:46:08,705 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 19:46:08,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 19:46:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144. [2020-02-10 19:46:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 19:46:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 402 transitions. [2020-02-10 19:46:08,709 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 402 transitions. Word has length 19 [2020-02-10 19:46:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,709 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 402 transitions. [2020-02-10 19:46:08,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 402 transitions. [2020-02-10 19:46:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:08,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,710 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1225211654, now seen corresponding path program 487 times [2020-02-10 19:46:08,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095639309] [2020-02-10 19:46:08,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,918 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:46:08,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095639309] [2020-02-10 19:46:08,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:08,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869657240] [2020-02-10 19:46:08,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:08,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:08,919 INFO L87 Difference]: Start difference. First operand 144 states and 402 transitions. Second operand 8 states. [2020-02-10 19:46:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,978 INFO L93 Difference]: Finished difference Result 250 states and 577 transitions. [2020-02-10 19:46:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:08,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,979 INFO L225 Difference]: With dead ends: 250 [2020-02-10 19:46:08,979 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 19:46:08,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 19:46:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-02-10 19:46:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-02-10 19:46:08,983 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-02-10 19:46:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,983 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-02-10 19:46:08,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-02-10 19:46:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:08,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,984 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash -926514892, now seen corresponding path program 488 times [2020-02-10 19:46:08,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20999999] [2020-02-10 19:46:08,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,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:46:09,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20999999] [2020-02-10 19:46:09,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:09,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461660567] [2020-02-10 19:46:09,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:09,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:09,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:09,190 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-02-10 19:46:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,267 INFO L93 Difference]: Finished difference Result 244 states and 562 transitions. [2020-02-10 19:46:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:09,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,268 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:46:09,268 INFO L226 Difference]: Without dead ends: 231 [2020-02-10 19:46:09,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-02-10 19:46:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-02-10 19:46:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 409 transitions. [2020-02-10 19:46:09,272 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 409 transitions. Word has length 19 [2020-02-10 19:46:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,272 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 409 transitions. [2020-02-10 19:46:09,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 409 transitions. [2020-02-10 19:46:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:09,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:09,272 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1975664054, now seen corresponding path program 489 times [2020-02-10 19:46:09,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080434353] [2020-02-10 19:46:09,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:09,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080434353] [2020-02-10 19:46:09,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:09,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680573757] [2020-02-10 19:46:09,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:09,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:09,482 INFO L87 Difference]: Start difference. First operand 147 states and 409 transitions. Second operand 8 states. [2020-02-10 19:46:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,540 INFO L93 Difference]: Finished difference Result 254 states and 586 transitions. [2020-02-10 19:46:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:09,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,541 INFO L225 Difference]: With dead ends: 254 [2020-02-10 19:46:09,541 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 19:46:09,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 19:46:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-02-10 19:46:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:46:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-02-10 19:46:09,546 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-02-10 19:46:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,546 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-02-10 19:46:09,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-02-10 19:46:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:09,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:09,546 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:09,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1568241148, now seen corresponding path program 490 times [2020-02-10 19:46:09,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727497878] [2020-02-10 19:46:09,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,752 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:46:09,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727497878] [2020-02-10 19:46:09,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:09,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963169223] [2020-02-10 19:46:09,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:09,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:09,754 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-02-10 19:46:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,829 INFO L93 Difference]: Finished difference Result 250 states and 574 transitions. [2020-02-10 19:46:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:09,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,830 INFO L225 Difference]: With dead ends: 250 [2020-02-10 19:46:09,830 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 19:46:09,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 19:46:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-02-10 19:46:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 406 transitions. [2020-02-10 19:46:09,834 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 406 transitions. Word has length 19 [2020-02-10 19:46:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,834 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 406 transitions. [2020-02-10 19:46:09,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 406 transitions. [2020-02-10 19:46:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:09,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:09,835 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1566078992, now seen corresponding path program 491 times [2020-02-10 19:46:09,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21909033] [2020-02-10 19:46:09,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,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:46:10,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21909033] [2020-02-10 19:46:10,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:10,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290047473] [2020-02-10 19:46:10,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:10,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:10,048 INFO L87 Difference]: Start difference. First operand 147 states and 406 transitions. Second operand 8 states. [2020-02-10 19:46:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,125 INFO L93 Difference]: Finished difference Result 239 states and 550 transitions. [2020-02-10 19:46:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:10,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,126 INFO L225 Difference]: With dead ends: 239 [2020-02-10 19:46:10,126 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 19:46:10,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 19:46:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-02-10 19:46:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 409 transitions. [2020-02-10 19:46:10,130 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 409 transitions. Word has length 19 [2020-02-10 19:46:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,131 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 409 transitions. [2020-02-10 19:46:10,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 409 transitions. [2020-02-10 19:46:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:10,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:10,131 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,132 INFO L82 PathProgramCache]: Analyzing trace with hash 144534316, now seen corresponding path program 492 times [2020-02-10 19:46:10,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796391872] [2020-02-10 19:46:10,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,337 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:46:10,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796391872] [2020-02-10 19:46:10,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:10,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521682090] [2020-02-10 19:46:10,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:10,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:10,338 INFO L87 Difference]: Start difference. First operand 149 states and 409 transitions. Second operand 8 states. [2020-02-10 19:46:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,425 INFO L93 Difference]: Finished difference Result 241 states and 553 transitions. [2020-02-10 19:46:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:10,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,426 INFO L225 Difference]: With dead ends: 241 [2020-02-10 19:46:10,426 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 19:46:10,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 19:46:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-02-10 19:46:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 19:46:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 400 transitions. [2020-02-10 19:46:10,430 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 400 transitions. Word has length 19 [2020-02-10 19:46:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,430 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 400 transitions. [2020-02-10 19:46:10,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 400 transitions. [2020-02-10 19:46:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:10,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:10,431 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1550807878, now seen corresponding path program 493 times [2020-02-10 19:46:10,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139676501] [2020-02-10 19:46:10,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,639 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:46:10,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139676501] [2020-02-10 19:46:10,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:10,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348353761] [2020-02-10 19:46:10,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:10,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:10,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:10,640 INFO L87 Difference]: Start difference. First operand 144 states and 400 transitions. Second operand 8 states. [2020-02-10 19:46:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,703 INFO L93 Difference]: Finished difference Result 250 states and 575 transitions. [2020-02-10 19:46:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:10,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,704 INFO L225 Difference]: With dead ends: 250 [2020-02-10 19:46:10,704 INFO L226 Difference]: Without dead ends: 234 [2020-02-10 19:46:10,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-02-10 19:46:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-02-10 19:46:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-02-10 19:46:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 414 transitions. [2020-02-10 19:46:10,707 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 414 transitions. Word has length 19 [2020-02-10 19:46:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,707 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 414 transitions. [2020-02-10 19:46:10,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 414 transitions. [2020-02-10 19:46:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:10,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:10,708 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1809866104, now seen corresponding path program 494 times [2020-02-10 19:46:10,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828669889] [2020-02-10 19:46:10,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,917 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:46:10,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828669889] [2020-02-10 19:46:10,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:10,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793006105] [2020-02-10 19:46:10,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:10,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:10,919 INFO L87 Difference]: Start difference. First operand 150 states and 414 transitions. Second operand 8 states. [2020-02-10 19:46:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,983 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 19:46:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:10,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,985 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:46:10,985 INFO L226 Difference]: Without dead ends: 231 [2020-02-10 19:46:10,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-02-10 19:46:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-02-10 19:46:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-02-10 19:46:10,989 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-02-10 19:46:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,989 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-02-10 19:46:10,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-02-10 19:46:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:10,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:10,990 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:10,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash -49629976, now seen corresponding path program 495 times [2020-02-10 19:46:10,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493571652] [2020-02-10 19:46:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,207 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:46:11,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493571652] [2020-02-10 19:46:11,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:11,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128505750] [2020-02-10 19:46:11,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:11,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:11,208 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-02-10 19:46:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,271 INFO L93 Difference]: Finished difference Result 254 states and 584 transitions. [2020-02-10 19:46:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:11,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,272 INFO L225 Difference]: With dead ends: 254 [2020-02-10 19:46:11,273 INFO L226 Difference]: Without dead ends: 238 [2020-02-10 19:46:11,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-02-10 19:46:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-02-10 19:46:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-02-10 19:46:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 416 transitions. [2020-02-10 19:46:11,277 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 416 transitions. Word has length 19 [2020-02-10 19:46:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,277 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 416 transitions. [2020-02-10 19:46:11,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 416 transitions. [2020-02-10 19:46:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:11,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:11,278 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash -800692070, now seen corresponding path program 496 times [2020-02-10 19:46:11,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856076957] [2020-02-10 19:46:11,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,487 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:46:11,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856076957] [2020-02-10 19:46:11,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:11,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594737004] [2020-02-10 19:46:11,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:11,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:11,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:11,489 INFO L87 Difference]: Start difference. First operand 152 states and 416 transitions. Second operand 8 states. [2020-02-10 19:46:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,575 INFO L93 Difference]: Finished difference Result 250 states and 572 transitions. [2020-02-10 19:46:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:11,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,576 INFO L225 Difference]: With dead ends: 250 [2020-02-10 19:46:11,576 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 19:46:11,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 19:46:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-02-10 19:46:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 404 transitions. [2020-02-10 19:46:11,580 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 404 transitions. Word has length 19 [2020-02-10 19:46:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,580 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 404 transitions. [2020-02-10 19:46:11,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 404 transitions. [2020-02-10 19:46:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:11,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:11,581 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 350791652, now seen corresponding path program 497 times [2020-02-10 19:46:11,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872967626] [2020-02-10 19:46:11,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:11,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872967626] [2020-02-10 19:46:11,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:11,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873050131] [2020-02-10 19:46:11,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:11,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:11,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:11,795 INFO L87 Difference]: Start difference. First operand 147 states and 404 transitions. Second operand 8 states. [2020-02-10 19:46:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,867 INFO L93 Difference]: Finished difference Result 239 states and 548 transitions. [2020-02-10 19:46:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:11,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,868 INFO L225 Difference]: With dead ends: 239 [2020-02-10 19:46:11,868 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 19:46:11,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 19:46:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-02-10 19:46:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 407 transitions. [2020-02-10 19:46:11,872 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 407 transitions. Word has length 19 [2020-02-10 19:46:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,872 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 407 transitions. [2020-02-10 19:46:11,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 407 transitions. [2020-02-10 19:46:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:11,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:11,872 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash -504515002, now seen corresponding path program 498 times [2020-02-10 19:46:11,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816705919] [2020-02-10 19:46:11,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,076 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:46:12,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816705919] [2020-02-10 19:46:12,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:12,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653252697] [2020-02-10 19:46:12,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:12,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:12,078 INFO L87 Difference]: Start difference. First operand 149 states and 407 transitions. Second operand 8 states. [2020-02-10 19:46:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,162 INFO L93 Difference]: Finished difference Result 241 states and 551 transitions. [2020-02-10 19:46:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:12,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,163 INFO L225 Difference]: With dead ends: 241 [2020-02-10 19:46:12,163 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 19:46:12,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 19:46:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-02-10 19:46:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-02-10 19:46:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 398 transitions. [2020-02-10 19:46:12,167 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 398 transitions. Word has length 19 [2020-02-10 19:46:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,167 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 398 transitions. [2020-02-10 19:46:12,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 398 transitions. [2020-02-10 19:46:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:12,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:12,168 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1269308130, now seen corresponding path program 499 times [2020-02-10 19:46:12,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613760537] [2020-02-10 19:46:12,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:12,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613760537] [2020-02-10 19:46:12,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:12,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16888130] [2020-02-10 19:46:12,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:12,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:12,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:12,381 INFO L87 Difference]: Start difference. First operand 144 states and 398 transitions. Second operand 8 states. [2020-02-10 19:46:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,469 INFO L93 Difference]: Finished difference Result 223 states and 511 transitions. [2020-02-10 19:46:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:12,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,470 INFO L225 Difference]: With dead ends: 223 [2020-02-10 19:46:12,470 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 19:46:12,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 19:46:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2020-02-10 19:46:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 19:46:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 402 transitions. [2020-02-10 19:46:12,474 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 402 transitions. Word has length 19 [2020-02-10 19:46:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,474 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 402 transitions. [2020-02-10 19:46:12,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 402 transitions. [2020-02-10 19:46:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:12,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:12,475 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1508950468, now seen corresponding path program 500 times [2020-02-10 19:46:12,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694119573] [2020-02-10 19:46:12,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,695 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:46:12,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694119573] [2020-02-10 19:46:12,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:12,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665991427] [2020-02-10 19:46:12,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:12,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:12,697 INFO L87 Difference]: Start difference. First operand 146 states and 402 transitions. Second operand 8 states. [2020-02-10 19:46:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,768 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-02-10 19:46:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:12,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,769 INFO L225 Difference]: With dead ends: 223 [2020-02-10 19:46:12,769 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 19:46:12,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 19:46:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2020-02-10 19:46:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 19:46:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 400 transitions. [2020-02-10 19:46:12,773 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 400 transitions. Word has length 19 [2020-02-10 19:46:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,773 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 400 transitions. [2020-02-10 19:46:12,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 400 transitions. [2020-02-10 19:46:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:12,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:12,773 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2014010628, now seen corresponding path program 501 times [2020-02-10 19:46:12,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929639701] [2020-02-10 19:46:12,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,983 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:46:12,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929639701] [2020-02-10 19:46:12,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:12,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935728829] [2020-02-10 19:46:12,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:12,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:12,984 INFO L87 Difference]: Start difference. First operand 145 states and 400 transitions. Second operand 8 states. [2020-02-10 19:46:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,071 INFO L93 Difference]: Finished difference Result 226 states and 518 transitions. [2020-02-10 19:46:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:13,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,072 INFO L225 Difference]: With dead ends: 226 [2020-02-10 19:46:13,072 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 19:46:13,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 19:46:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-02-10 19:46:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 403 transitions. [2020-02-10 19:46:13,075 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 403 transitions. Word has length 19 [2020-02-10 19:46:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,075 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 403 transitions. [2020-02-10 19:46:13,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 403 transitions. [2020-02-10 19:46:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:13,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:13,076 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -303397320, now seen corresponding path program 502 times [2020-02-10 19:46:13,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260073550] [2020-02-10 19:46:13,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,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:46:13,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260073550] [2020-02-10 19:46:13,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:13,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88998766] [2020-02-10 19:46:13,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:13,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:13,287 INFO L87 Difference]: Start difference. First operand 147 states and 403 transitions. Second operand 8 states. [2020-02-10 19:46:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,380 INFO L93 Difference]: Finished difference Result 228 states and 521 transitions. [2020-02-10 19:46:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:13,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,381 INFO L225 Difference]: With dead ends: 228 [2020-02-10 19:46:13,381 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 19:46:13,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 19:46:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2020-02-10 19:46:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 19:46:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 399 transitions. [2020-02-10 19:46:13,384 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 399 transitions. Word has length 19 [2020-02-10 19:46:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,384 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 399 transitions. [2020-02-10 19:46:13,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 399 transitions. [2020-02-10 19:46:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:13,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:13,385 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1712931448, now seen corresponding path program 503 times [2020-02-10 19:46:13,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454062908] [2020-02-10 19:46:13,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,599 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:46:13,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454062908] [2020-02-10 19:46:13,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:13,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321254875] [2020-02-10 19:46:13,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:13,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:13,600 INFO L87 Difference]: Start difference. First operand 145 states and 399 transitions. Second operand 8 states. [2020-02-10 19:46:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,668 INFO L93 Difference]: Finished difference Result 226 states and 517 transitions. [2020-02-10 19:46:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:13,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,669 INFO L225 Difference]: With dead ends: 226 [2020-02-10 19:46:13,669 INFO L226 Difference]: Without dead ends: 216 [2020-02-10 19:46:13,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-02-10 19:46:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-02-10 19:46:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 19:46:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 402 transitions. [2020-02-10 19:46:13,673 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 402 transitions. Word has length 19 [2020-02-10 19:46:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,673 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 402 transitions. [2020-02-10 19:46:13,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 402 transitions. [2020-02-10 19:46:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:13,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:13,674 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash 857624794, now seen corresponding path program 504 times [2020-02-10 19:46:13,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979811144] [2020-02-10 19:46:13,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:13,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979811144] [2020-02-10 19:46:13,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:13,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988738898] [2020-02-10 19:46:13,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:13,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:13,896 INFO L87 Difference]: Start difference. First operand 147 states and 402 transitions. Second operand 8 states. [2020-02-10 19:46:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,987 INFO L93 Difference]: Finished difference Result 228 states and 520 transitions. [2020-02-10 19:46:13,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:13,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,988 INFO L225 Difference]: With dead ends: 228 [2020-02-10 19:46:13,988 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 19:46:13,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 19:46:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2020-02-10 19:46:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 19:46:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 394 transitions. [2020-02-10 19:46:13,992 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 394 transitions. Word has length 19 [2020-02-10 19:46:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,992 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 394 transitions. [2020-02-10 19:46:13,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 394 transitions. [2020-02-10 19:46:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:13,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:13,992 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1123308150, now seen corresponding path program 505 times [2020-02-10 19:46:13,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136416358] [2020-02-10 19:46:13,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,183 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:46:14,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136416358] [2020-02-10 19:46:14,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:14,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656490982] [2020-02-10 19:46:14,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:14,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:14,185 INFO L87 Difference]: Start difference. First operand 142 states and 394 transitions. Second operand 8 states. [2020-02-10 19:46:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,253 INFO L93 Difference]: Finished difference Result 241 states and 546 transitions. [2020-02-10 19:46:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:14,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,254 INFO L225 Difference]: With dead ends: 241 [2020-02-10 19:46:14,255 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 19:46:14,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 19:46:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-02-10 19:46:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 19:46:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 398 transitions. [2020-02-10 19:46:14,259 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 398 transitions. Word has length 19 [2020-02-10 19:46:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,259 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 398 transitions. [2020-02-10 19:46:14,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 398 transitions. [2020-02-10 19:46:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:14,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:14,260 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1019932600, now seen corresponding path program 506 times [2020-02-10 19:46:14,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179394081] [2020-02-10 19:46:14,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,447 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:46:14,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179394081] [2020-02-10 19:46:14,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:14,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677312028] [2020-02-10 19:46:14,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:14,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:14,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:14,449 INFO L87 Difference]: Start difference. First operand 145 states and 398 transitions. Second operand 8 states. [2020-02-10 19:46:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,528 INFO L93 Difference]: Finished difference Result 235 states and 531 transitions. [2020-02-10 19:46:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:14,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,530 INFO L225 Difference]: With dead ends: 235 [2020-02-10 19:46:14,530 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 19:46:14,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 19:46:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-02-10 19:46:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 19:46:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 392 transitions. [2020-02-10 19:46:14,534 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 392 transitions. Word has length 19 [2020-02-10 19:46:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,534 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 392 transitions. [2020-02-10 19:46:14,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 392 transitions. [2020-02-10 19:46:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:14,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:14,535 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:14,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1571221292, now seen corresponding path program 507 times [2020-02-10 19:46:14,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588965720] [2020-02-10 19:46:14,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,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:46:14,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588965720] [2020-02-10 19:46:14,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:14,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271884130] [2020-02-10 19:46:14,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:14,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:14,734 INFO L87 Difference]: Start difference. First operand 142 states and 392 transitions. Second operand 8 states. [2020-02-10 19:46:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,790 INFO L93 Difference]: Finished difference Result 241 states and 544 transitions. [2020-02-10 19:46:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:14,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,792 INFO L225 Difference]: With dead ends: 241 [2020-02-10 19:46:14,792 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 19:46:14,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 19:46:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-02-10 19:46:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 19:46:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 396 transitions. [2020-02-10 19:46:14,796 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 396 transitions. Word has length 19 [2020-02-10 19:46:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,796 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 396 transitions. [2020-02-10 19:46:14,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 396 transitions. [2020-02-10 19:46:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:14,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:14,797 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1830279518, now seen corresponding path program 508 times [2020-02-10 19:46:14,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246225364] [2020-02-10 19:46:14,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,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:46:14,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246225364] [2020-02-10 19:46:14,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:14,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877539425] [2020-02-10 19:46:15,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:15,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:15,000 INFO L87 Difference]: Start difference. First operand 145 states and 396 transitions. Second operand 8 states. [2020-02-10 19:46:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,073 INFO L93 Difference]: Finished difference Result 235 states and 529 transitions. [2020-02-10 19:46:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:15,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,074 INFO L225 Difference]: With dead ends: 235 [2020-02-10 19:46:15,074 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 19:46:15,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 19:46:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-02-10 19:46:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 19:46:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 390 transitions. [2020-02-10 19:46:15,086 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 390 transitions. Word has length 19 [2020-02-10 19:46:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,086 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 390 transitions. [2020-02-10 19:46:15,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 390 transitions. [2020-02-10 19:46:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:15,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:15,087 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,088 INFO L82 PathProgramCache]: Analyzing trace with hash 589841196, now seen corresponding path program 509 times [2020-02-10 19:46:15,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774941607] [2020-02-10 19:46:15,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,286 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:46:15,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774941607] [2020-02-10 19:46:15,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:15,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105565040] [2020-02-10 19:46:15,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:15,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:15,288 INFO L87 Difference]: Start difference. First operand 142 states and 390 transitions. Second operand 8 states. [2020-02-10 19:46:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,372 INFO L93 Difference]: Finished difference Result 227 states and 513 transitions. [2020-02-10 19:46:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:15,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,373 INFO L225 Difference]: With dead ends: 227 [2020-02-10 19:46:15,373 INFO L226 Difference]: Without dead ends: 217 [2020-02-10 19:46:15,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-02-10 19:46:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2020-02-10 19:46:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-02-10 19:46:15,377 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-02-10 19:46:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,377 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-02-10 19:46:15,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-02-10 19:46:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:15,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:15,378 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash 350198858, now seen corresponding path program 510 times [2020-02-10 19:46:15,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182486737] [2020-02-10 19:46:15,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:15,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182486737] [2020-02-10 19:46:15,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:15,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886181547] [2020-02-10 19:46:15,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:15,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:15,583 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-02-10 19:46:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,651 INFO L93 Difference]: Finished difference Result 227 states and 512 transitions. [2020-02-10 19:46:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:15,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,652 INFO L225 Difference]: With dead ends: 227 [2020-02-10 19:46:15,652 INFO L226 Difference]: Without dead ends: 214 [2020-02-10 19:46:15,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-02-10 19:46:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2020-02-10 19:46:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 19:46:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 386 transitions. [2020-02-10 19:46:15,656 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 386 transitions. Word has length 19 [2020-02-10 19:46:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,656 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 386 transitions. [2020-02-10 19:46:15,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 386 transitions. [2020-02-10 19:46:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:15,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:15,656 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1566207290, now seen corresponding path program 511 times [2020-02-10 19:46:15,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50035429] [2020-02-10 19:46:15,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,834 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:46:15,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50035429] [2020-02-10 19:46:15,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:15,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015913939] [2020-02-10 19:46:15,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:15,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:15,836 INFO L87 Difference]: Start difference. First operand 140 states and 386 transitions. Second operand 8 states. [2020-02-10 19:46:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,901 INFO L93 Difference]: Finished difference Result 246 states and 561 transitions. [2020-02-10 19:46:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:15,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,902 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:46:15,902 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 19:46:15,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 19:46:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-02-10 19:46:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 19:46:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 400 transitions. [2020-02-10 19:46:15,905 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 400 transitions. Word has length 19 [2020-02-10 19:46:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,906 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 400 transitions. [2020-02-10 19:46:15,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 400 transitions. [2020-02-10 19:46:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:15,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:15,906 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,906 INFO L82 PathProgramCache]: Analyzing trace with hash 577033460, now seen corresponding path program 512 times [2020-02-10 19:46:15,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992141367] [2020-02-10 19:46:15,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,113 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:46:16,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992141367] [2020-02-10 19:46:16,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:16,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887605699] [2020-02-10 19:46:16,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:16,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:16,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:16,114 INFO L87 Difference]: Start difference. First operand 146 states and 400 transitions. Second operand 8 states. [2020-02-10 19:46:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,197 INFO L93 Difference]: Finished difference Result 240 states and 546 transitions. [2020-02-10 19:46:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:16,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,198 INFO L225 Difference]: With dead ends: 240 [2020-02-10 19:46:16,198 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 19:46:16,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 19:46:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-02-10 19:46:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 393 transitions. [2020-02-10 19:46:16,202 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 393 transitions. Word has length 19 [2020-02-10 19:46:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,202 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 393 transitions. [2020-02-10 19:46:16,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 393 transitions. [2020-02-10 19:46:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:16,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:16,203 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2072553556, now seen corresponding path program 513 times [2020-02-10 19:46:16,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534613401] [2020-02-10 19:46:16,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:16,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534613401] [2020-02-10 19:46:16,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:16,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464833088] [2020-02-10 19:46:16,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:16,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:16,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:16,387 INFO L87 Difference]: Start difference. First operand 143 states and 393 transitions. Second operand 8 states. [2020-02-10 19:46:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,454 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-02-10 19:46:16,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:16,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,455 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:46:16,455 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 19:46:16,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 19:46:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 19:46:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 404 transitions. [2020-02-10 19:46:16,458 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 404 transitions. Word has length 19 [2020-02-10 19:46:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,459 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 404 transitions. [2020-02-10 19:46:16,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 404 transitions. [2020-02-10 19:46:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:16,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:16,459 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1246208990, now seen corresponding path program 514 times [2020-02-10 19:46:16,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643664694] [2020-02-10 19:46:16,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,637 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:46:16,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643664694] [2020-02-10 19:46:16,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:16,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867492536] [2020-02-10 19:46:16,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:16,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:16,639 INFO L87 Difference]: Start difference. First operand 149 states and 404 transitions. Second operand 8 states. [2020-02-10 19:46:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,722 INFO L93 Difference]: Finished difference Result 232 states and 540 transitions. [2020-02-10 19:46:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:16,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,723 INFO L225 Difference]: With dead ends: 232 [2020-02-10 19:46:16,723 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 19:46:16,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 19:46:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-02-10 19:46:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 390 transitions. [2020-02-10 19:46:16,726 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 390 transitions. Word has length 19 [2020-02-10 19:46:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,726 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 390 transitions. [2020-02-10 19:46:16,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 390 transitions. [2020-02-10 19:46:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:16,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:16,727 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 692674962, now seen corresponding path program 515 times [2020-02-10 19:46:16,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090670659] [2020-02-10 19:46:16,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,904 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:46:16,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090670659] [2020-02-10 19:46:16,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:16,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883133935] [2020-02-10 19:46:16,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:16,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:16,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:16,905 INFO L87 Difference]: Start difference. First operand 143 states and 390 transitions. Second operand 8 states. [2020-02-10 19:46:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,987 INFO L93 Difference]: Finished difference Result 234 states and 533 transitions. [2020-02-10 19:46:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:16,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,988 INFO L225 Difference]: With dead ends: 234 [2020-02-10 19:46:16,989 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 19:46:16,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 19:46:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-02-10 19:46:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 19:46:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 393 transitions. [2020-02-10 19:46:16,993 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 393 transitions. Word has length 19 [2020-02-10 19:46:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,993 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 393 transitions. [2020-02-10 19:46:16,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 393 transitions. [2020-02-10 19:46:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:16,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:16,994 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1036372372, now seen corresponding path program 516 times [2020-02-10 19:46:16,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671673643] [2020-02-10 19:46:16,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,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:46:17,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671673643] [2020-02-10 19:46:17,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:17,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039471991] [2020-02-10 19:46:17,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:17,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:17,166 INFO L87 Difference]: Start difference. First operand 145 states and 393 transitions. Second operand 8 states. [2020-02-10 19:46:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,251 INFO L93 Difference]: Finished difference Result 228 states and 529 transitions. [2020-02-10 19:46:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:17,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,252 INFO L225 Difference]: With dead ends: 228 [2020-02-10 19:46:17,252 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 19:46:17,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 19:46:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-02-10 19:46:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 19:46:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 384 transitions. [2020-02-10 19:46:17,256 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 384 transitions. Word has length 19 [2020-02-10 19:46:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,256 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 384 transitions. [2020-02-10 19:46:17,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 384 transitions. [2020-02-10 19:46:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:17,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:17,257 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1240611066, now seen corresponding path program 517 times [2020-02-10 19:46:17,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758895789] [2020-02-10 19:46:17,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:17,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758895789] [2020-02-10 19:46:17,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:17,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931777702] [2020-02-10 19:46:17,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:17,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:17,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:17,444 INFO L87 Difference]: Start difference. First operand 140 states and 384 transitions. Second operand 8 states. [2020-02-10 19:46:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,505 INFO L93 Difference]: Finished difference Result 246 states and 559 transitions. [2020-02-10 19:46:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:17,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,506 INFO L225 Difference]: With dead ends: 246 [2020-02-10 19:46:17,506 INFO L226 Difference]: Without dead ends: 230 [2020-02-10 19:46:17,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-02-10 19:46:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-02-10 19:46:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-02-10 19:46:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 398 transitions. [2020-02-10 19:46:17,510 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 398 transitions. Word has length 19 [2020-02-10 19:46:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,511 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 398 transitions. [2020-02-10 19:46:17,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 398 transitions. [2020-02-10 19:46:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:17,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:17,511 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash -981552840, now seen corresponding path program 518 times [2020-02-10 19:46:17,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979950366] [2020-02-10 19:46:17,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,704 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:46:17,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979950366] [2020-02-10 19:46:17,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:17,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359698447] [2020-02-10 19:46:17,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:17,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:17,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:17,705 INFO L87 Difference]: Start difference. First operand 146 states and 398 transitions. Second operand 8 states. [2020-02-10 19:46:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,769 INFO L93 Difference]: Finished difference Result 240 states and 544 transitions. [2020-02-10 19:46:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:17,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,770 INFO L225 Difference]: With dead ends: 240 [2020-02-10 19:46:17,770 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 19:46:17,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 19:46:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-02-10 19:46:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-02-10 19:46:17,774 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-02-10 19:46:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,774 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-02-10 19:46:17,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-02-10 19:46:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:17,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:17,775 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:17,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash -146519478, now seen corresponding path program 519 times [2020-02-10 19:46:17,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860689517] [2020-02-10 19:46:17,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,966 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:46:17,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860689517] [2020-02-10 19:46:17,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:17,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865634152] [2020-02-10 19:46:17,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:17,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:17,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:17,967 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-02-10 19:46:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,031 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-02-10 19:46:18,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:18,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,032 INFO L225 Difference]: With dead ends: 244 [2020-02-10 19:46:18,032 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 19:46:18,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 19:46:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-02-10 19:46:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-02-10 19:46:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 402 transitions. [2020-02-10 19:46:18,036 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 402 transitions. Word has length 19 [2020-02-10 19:46:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,037 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 402 transitions. [2020-02-10 19:46:18,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 402 transitions. [2020-02-10 19:46:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:18,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:18,037 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1122724228, now seen corresponding path program 520 times [2020-02-10 19:46:18,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900197049] [2020-02-10 19:46:18,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,222 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:46:18,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900197049] [2020-02-10 19:46:18,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:18,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912639708] [2020-02-10 19:46:18,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:18,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:18,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:18,224 INFO L87 Difference]: Start difference. First operand 149 states and 402 transitions. Second operand 8 states. [2020-02-10 19:46:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,308 INFO L93 Difference]: Finished difference Result 232 states and 538 transitions. [2020-02-10 19:46:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:18,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,309 INFO L225 Difference]: With dead ends: 232 [2020-02-10 19:46:18,309 INFO L226 Difference]: Without dead ends: 213 [2020-02-10 19:46:18,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-02-10 19:46:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-02-10 19:46:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 388 transitions. [2020-02-10 19:46:18,313 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 388 transitions. Word has length 19 [2020-02-10 19:46:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,313 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 388 transitions. [2020-02-10 19:46:18,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 388 transitions. [2020-02-10 19:46:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:18,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:18,314 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1864843108, now seen corresponding path program 521 times [2020-02-10 19:46:18,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494461759] [2020-02-10 19:46:18,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,506 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:46:18,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494461759] [2020-02-10 19:46:18,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:18,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184199957] [2020-02-10 19:46:18,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:18,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:18,507 INFO L87 Difference]: Start difference. First operand 143 states and 388 transitions. Second operand 8 states. [2020-02-10 19:46:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,572 INFO L93 Difference]: Finished difference Result 234 states and 531 transitions. [2020-02-10 19:46:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:18,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,573 INFO L225 Difference]: With dead ends: 234 [2020-02-10 19:46:18,573 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 19:46:18,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 19:46:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-02-10 19:46:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-02-10 19:46:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 391 transitions. [2020-02-10 19:46:18,577 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 391 transitions. Word has length 19 [2020-02-10 19:46:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,577 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 391 transitions. [2020-02-10 19:46:18,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 391 transitions. [2020-02-10 19:46:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:18,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:18,578 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash -940719192, now seen corresponding path program 522 times [2020-02-10 19:46:18,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394581387] [2020-02-10 19:46:18,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,770 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:46:18,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394581387] [2020-02-10 19:46:18,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:18,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479957557] [2020-02-10 19:46:18,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:18,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:18,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:18,771 INFO L87 Difference]: Start difference. First operand 145 states and 391 transitions. Second operand 8 states. [2020-02-10 19:46:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,860 INFO L93 Difference]: Finished difference Result 228 states and 527 transitions. [2020-02-10 19:46:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:18,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,861 INFO L225 Difference]: With dead ends: 228 [2020-02-10 19:46:18,861 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 19:46:18,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 19:46:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-02-10 19:46:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 19:46:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 382 transitions. [2020-02-10 19:46:18,865 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 382 transitions. Word has length 19 [2020-02-10 19:46:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,865 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 382 transitions. [2020-02-10 19:46:18,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 382 transitions. [2020-02-10 19:46:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:18,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:18,866 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1366197632, now seen corresponding path program 523 times [2020-02-10 19:46:18,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763118668] [2020-02-10 19:46:18,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,064 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:46:19,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763118668] [2020-02-10 19:46:19,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:19,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959529217] [2020-02-10 19:46:19,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:19,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:19,066 INFO L87 Difference]: Start difference. First operand 140 states and 382 transitions. Second operand 8 states. [2020-02-10 19:46:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,155 INFO L93 Difference]: Finished difference Result 220 states and 497 transitions. [2020-02-10 19:46:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:19,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,156 INFO L225 Difference]: With dead ends: 220 [2020-02-10 19:46:19,156 INFO L226 Difference]: Without dead ends: 210 [2020-02-10 19:46:19,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-02-10 19:46:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2020-02-10 19:46:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-02-10 19:46:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 386 transitions. [2020-02-10 19:46:19,159 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 386 transitions. Word has length 19 [2020-02-10 19:46:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,160 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 386 transitions. [2020-02-10 19:46:19,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 386 transitions. [2020-02-10 19:46:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:19,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:19,160 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1605839970, now seen corresponding path program 524 times [2020-02-10 19:46:19,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092922789] [2020-02-10 19:46:19,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,401 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:46:19,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092922789] [2020-02-10 19:46:19,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:19,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012365090] [2020-02-10 19:46:19,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:19,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:19,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:19,403 INFO L87 Difference]: Start difference. First operand 142 states and 386 transitions. Second operand 8 states. [2020-02-10 19:46:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,460 INFO L93 Difference]: Finished difference Result 220 states and 496 transitions. [2020-02-10 19:46:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:19,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,461 INFO L225 Difference]: With dead ends: 220 [2020-02-10 19:46:19,461 INFO L226 Difference]: Without dead ends: 209 [2020-02-10 19:46:19,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-02-10 19:46:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2020-02-10 19:46:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 19:46:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 384 transitions. [2020-02-10 19:46:19,465 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 384 transitions. Word has length 19 [2020-02-10 19:46:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,466 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 384 transitions. [2020-02-10 19:46:19,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 384 transitions. [2020-02-10 19:46:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:19,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:19,467 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1855684284, now seen corresponding path program 525 times [2020-02-10 19:46:19,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430720841] [2020-02-10 19:46:19,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,660 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:46:19,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430720841] [2020-02-10 19:46:19,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:19,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874452062] [2020-02-10 19:46:19,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:19,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:19,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:19,662 INFO L87 Difference]: Start difference. First operand 141 states and 384 transitions. Second operand 8 states. [2020-02-10 19:46:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,735 INFO L93 Difference]: Finished difference Result 222 states and 503 transitions. [2020-02-10 19:46:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:19,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,736 INFO L225 Difference]: With dead ends: 222 [2020-02-10 19:46:19,736 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 19:46:19,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 19:46:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-02-10 19:46:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 387 transitions. [2020-02-10 19:46:19,743 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 387 transitions. Word has length 19 [2020-02-10 19:46:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,743 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 387 transitions. [2020-02-10 19:46:19,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 387 transitions. [2020-02-10 19:46:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:19,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:19,743 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:19,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1484304008, now seen corresponding path program 526 times [2020-02-10 19:46:19,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243015945] [2020-02-10 19:46:19,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,934 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:46:19,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243015945] [2020-02-10 19:46:19,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:19,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959664468] [2020-02-10 19:46:19,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:19,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:19,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:19,935 INFO L87 Difference]: Start difference. First operand 143 states and 387 transitions. Second operand 8 states. [2020-02-10 19:46:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,024 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-02-10 19:46:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:20,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,025 INFO L225 Difference]: With dead ends: 216 [2020-02-10 19:46:20,025 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 19:46:20,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 19:46:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 141. [2020-02-10 19:46:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 19:46:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 383 transitions. [2020-02-10 19:46:20,029 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 383 transitions. Word has length 19 [2020-02-10 19:46:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,029 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 383 transitions. [2020-02-10 19:46:20,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 383 transitions. [2020-02-10 19:46:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:20,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,030 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:20,030 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1067984392, now seen corresponding path program 527 times [2020-02-10 19:46:20,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791416391] [2020-02-10 19:46:20,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,227 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:46:20,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791416391] [2020-02-10 19:46:20,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:20,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695387215] [2020-02-10 19:46:20,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:20,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:20,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:20,228 INFO L87 Difference]: Start difference. First operand 141 states and 383 transitions. Second operand 8 states. [2020-02-10 19:46:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,292 INFO L93 Difference]: Finished difference Result 222 states and 502 transitions. [2020-02-10 19:46:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:20,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,293 INFO L225 Difference]: With dead ends: 222 [2020-02-10 19:46:20,293 INFO L226 Difference]: Without dead ends: 212 [2020-02-10 19:46:20,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-02-10 19:46:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-02-10 19:46:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 386 transitions. [2020-02-10 19:46:20,297 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 386 transitions. Word has length 19 [2020-02-10 19:46:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,297 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 386 transitions. [2020-02-10 19:46:20,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 386 transitions. [2020-02-10 19:46:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:20,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:20,297 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash 421420604, now seen corresponding path program 528 times [2020-02-10 19:46:20,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742419809] [2020-02-10 19:46:20,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:20,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742419809] [2020-02-10 19:46:20,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:20,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109883451] [2020-02-10 19:46:20,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:20,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:20,490 INFO L87 Difference]: Start difference. First operand 143 states and 386 transitions. Second operand 8 states. [2020-02-10 19:46:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,580 INFO L93 Difference]: Finished difference Result 216 states and 498 transitions. [2020-02-10 19:46:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:20,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,581 INFO L225 Difference]: With dead ends: 216 [2020-02-10 19:46:20,581 INFO L226 Difference]: Without dead ends: 198 [2020-02-10 19:46:20,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-02-10 19:46:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 138. [2020-02-10 19:46:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 19:46:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 378 transitions. [2020-02-10 19:46:20,585 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 378 transitions. Word has length 19 [2020-02-10 19:46:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,585 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 378 transitions. [2020-02-10 19:46:20,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 378 transitions. [2020-02-10 19:46:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:20,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:20,586 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,586 INFO L82 PathProgramCache]: Analyzing trace with hash 380240202, now seen corresponding path program 529 times [2020-02-10 19:46:20,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379682882] [2020-02-10 19:46:20,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,789 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:46:20,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379682882] [2020-02-10 19:46:20,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:20,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321411130] [2020-02-10 19:46:20,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:20,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:20,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:20,790 INFO L87 Difference]: Start difference. First operand 138 states and 378 transitions. Second operand 8 states. [2020-02-10 19:46:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,850 INFO L93 Difference]: Finished difference Result 245 states and 557 transitions. [2020-02-10 19:46:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:20,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,851 INFO L225 Difference]: With dead ends: 245 [2020-02-10 19:46:20,851 INFO L226 Difference]: Without dead ends: 229 [2020-02-10 19:46:20,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-02-10 19:46:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 141. [2020-02-10 19:46:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-02-10 19:46:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 382 transitions. [2020-02-10 19:46:20,856 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 382 transitions. Word has length 19 [2020-02-10 19:46:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,856 INFO L479 AbstractCegarLoop]: Abstraction has 141 states and 382 transitions. [2020-02-10 19:46:20,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 382 transitions. [2020-02-10 19:46:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:20,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:20,856 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1771486344, now seen corresponding path program 530 times [2020-02-10 19:46:20,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628584311] [2020-02-10 19:46:20,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,049 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:46:21,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628584311] [2020-02-10 19:46:21,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:21,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442614252] [2020-02-10 19:46:21,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:21,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:21,051 INFO L87 Difference]: Start difference. First operand 141 states and 382 transitions. Second operand 8 states. [2020-02-10 19:46:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,132 INFO L93 Difference]: Finished difference Result 239 states and 542 transitions. [2020-02-10 19:46:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:21,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,133 INFO L225 Difference]: With dead ends: 239 [2020-02-10 19:46:21,133 INFO L226 Difference]: Without dead ends: 226 [2020-02-10 19:46:21,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-02-10 19:46:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2020-02-10 19:46:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 19:46:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 375 transitions. [2020-02-10 19:46:21,138 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 375 transitions. Word has length 19 [2020-02-10 19:46:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,138 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 375 transitions. [2020-02-10 19:46:21,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 375 transitions. [2020-02-10 19:46:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:21,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:21,139 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1474331790, now seen corresponding path program 531 times [2020-02-10 19:46:21,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92616911] [2020-02-10 19:46:21,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,345 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:46:21,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92616911] [2020-02-10 19:46:21,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:21,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652609208] [2020-02-10 19:46:21,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:21,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:21,347 INFO L87 Difference]: Start difference. First operand 138 states and 375 transitions. Second operand 8 states. [2020-02-10 19:46:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,411 INFO L93 Difference]: Finished difference Result 249 states and 566 transitions. [2020-02-10 19:46:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:21,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,412 INFO L225 Difference]: With dead ends: 249 [2020-02-10 19:46:21,412 INFO L226 Difference]: Without dead ends: 233 [2020-02-10 19:46:21,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-02-10 19:46:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 143. [2020-02-10 19:46:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-02-10 19:46:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 384 transitions. [2020-02-10 19:46:21,415 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 384 transitions. Word has length 19 [2020-02-10 19:46:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,415 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 384 transitions. [2020-02-10 19:46:21,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 384 transitions. [2020-02-10 19:46:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:21,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:21,416 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,416 INFO L82 PathProgramCache]: Analyzing trace with hash 723269696, now seen corresponding path program 532 times [2020-02-10 19:46:21,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952362782] [2020-02-10 19:46:21,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,626 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:46:21,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952362782] [2020-02-10 19:46:21,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:21,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360713456] [2020-02-10 19:46:21,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:21,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:21,628 INFO L87 Difference]: Start difference. First operand 143 states and 384 transitions. Second operand 8 states. [2020-02-10 19:46:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,712 INFO L93 Difference]: Finished difference Result 245 states and 554 transitions. [2020-02-10 19:46:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:21,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,713 INFO L225 Difference]: With dead ends: 245 [2020-02-10 19:46:21,714 INFO L226 Difference]: Without dead ends: 228 [2020-02-10 19:46:21,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-02-10 19:46:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 138. [2020-02-10 19:46:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 19:46:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 372 transitions. [2020-02-10 19:46:21,717 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 372 transitions. Word has length 19 [2020-02-10 19:46:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,718 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 372 transitions. [2020-02-10 19:46:21,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 372 transitions. [2020-02-10 19:46:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:21,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:21,718 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1883916852, now seen corresponding path program 533 times [2020-02-10 19:46:21,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097029993] [2020-02-10 19:46:21,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,916 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:46:21,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097029993] [2020-02-10 19:46:21,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:21,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834055148] [2020-02-10 19:46:21,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:21,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:21,917 INFO L87 Difference]: Start difference. First operand 138 states and 372 transitions. Second operand 8 states. [2020-02-10 19:46:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,999 INFO L93 Difference]: Finished difference Result 234 states and 530 transitions. [2020-02-10 19:46:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:22,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,001 INFO L225 Difference]: With dead ends: 234 [2020-02-10 19:46:22,001 INFO L226 Difference]: Without dead ends: 224 [2020-02-10 19:46:22,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-02-10 19:46:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-02-10 19:46:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 19:46:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 375 transitions. [2020-02-10 19:46:22,004 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 375 transitions. Word has length 19 [2020-02-10 19:46:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,005 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 375 transitions. [2020-02-10 19:46:22,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 375 transitions. [2020-02-10 19:46:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:22,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:22,005 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash -700437136, now seen corresponding path program 534 times [2020-02-10 19:46:22,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19046210] [2020-02-10 19:46:22,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,198 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:46:22,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19046210] [2020-02-10 19:46:22,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:22,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932230637] [2020-02-10 19:46:22,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:22,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:22,199 INFO L87 Difference]: Start difference. First operand 140 states and 375 transitions. Second operand 8 states. [2020-02-10 19:46:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,284 INFO L93 Difference]: Finished difference Result 236 states and 533 transitions. [2020-02-10 19:46:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:22,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,285 INFO L225 Difference]: With dead ends: 236 [2020-02-10 19:46:22,285 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 19:46:22,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 19:46:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 135. [2020-02-10 19:46:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 19:46:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 365 transitions. [2020-02-10 19:46:22,289 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 365 transitions. Word has length 19 [2020-02-10 19:46:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,289 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 365 transitions. [2020-02-10 19:46:22,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 365 transitions. [2020-02-10 19:46:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:22,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:22,290 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1988693016, now seen corresponding path program 535 times [2020-02-10 19:46:22,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670932729] [2020-02-10 19:46:22,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,477 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:46:22,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670932729] [2020-02-10 19:46:22,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:22,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529354515] [2020-02-10 19:46:22,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:22,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:22,479 INFO L87 Difference]: Start difference. First operand 135 states and 365 transitions. Second operand 8 states. [2020-02-10 19:46:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,541 INFO L93 Difference]: Finished difference Result 241 states and 542 transitions. [2020-02-10 19:46:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:22,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,542 INFO L225 Difference]: With dead ends: 241 [2020-02-10 19:46:22,542 INFO L226 Difference]: Without dead ends: 225 [2020-02-10 19:46:22,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-02-10 19:46:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 135. [2020-02-10 19:46:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 19:46:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 362 transitions. [2020-02-10 19:46:22,546 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 362 transitions. Word has length 19 [2020-02-10 19:46:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,546 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 362 transitions. [2020-02-10 19:46:22,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 362 transitions. [2020-02-10 19:46:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:22,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:22,547 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 154547734, now seen corresponding path program 536 times [2020-02-10 19:46:22,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693891195] [2020-02-10 19:46:22,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,719 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:46:22,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693891195] [2020-02-10 19:46:22,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:22,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53177589] [2020-02-10 19:46:22,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:22,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:22,720 INFO L87 Difference]: Start difference. First operand 135 states and 362 transitions. Second operand 8 states. [2020-02-10 19:46:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,797 INFO L93 Difference]: Finished difference Result 235 states and 527 transitions. [2020-02-10 19:46:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:22,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,798 INFO L225 Difference]: With dead ends: 235 [2020-02-10 19:46:22,798 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 19:46:22,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 19:46:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2020-02-10 19:46:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-02-10 19:46:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 355 transitions. [2020-02-10 19:46:22,801 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 355 transitions. Word has length 19 [2020-02-10 19:46:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,801 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 355 transitions. [2020-02-10 19:46:22,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 355 transitions. [2020-02-10 19:46:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:22,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:22,802 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:22,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1799928014, now seen corresponding path program 537 times [2020-02-10 19:46:22,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893557361] [2020-02-10 19:46:22,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,989 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:46:22,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893557361] [2020-02-10 19:46:22,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:22,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233218087] [2020-02-10 19:46:22,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:22,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:22,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:22,990 INFO L87 Difference]: Start difference. First operand 132 states and 355 transitions. Second operand 8 states. [2020-02-10 19:46:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,054 INFO L93 Difference]: Finished difference Result 239 states and 541 transitions. [2020-02-10 19:46:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:23,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,056 INFO L225 Difference]: With dead ends: 239 [2020-02-10 19:46:23,056 INFO L226 Difference]: Without dead ends: 223 [2020-02-10 19:46:23,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-02-10 19:46:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 138. [2020-02-10 19:46:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 19:46:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 366 transitions. [2020-02-10 19:46:23,060 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 366 transitions. Word has length 19 [2020-02-10 19:46:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,060 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 366 transitions. [2020-02-10 19:46:23,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 366 transitions. [2020-02-10 19:46:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:23,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:23,060 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 823723264, now seen corresponding path program 538 times [2020-02-10 19:46:23,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546597669] [2020-02-10 19:46:23,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,241 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:46:23,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546597669] [2020-02-10 19:46:23,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:23,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424610879] [2020-02-10 19:46:23,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:23,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:23,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:23,243 INFO L87 Difference]: Start difference. First operand 138 states and 366 transitions. Second operand 8 states. [2020-02-10 19:46:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,326 INFO L93 Difference]: Finished difference Result 227 states and 521 transitions. [2020-02-10 19:46:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:23,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,327 INFO L225 Difference]: With dead ends: 227 [2020-02-10 19:46:23,327 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 19:46:23,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 19:46:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 132. [2020-02-10 19:46:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-02-10 19:46:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 352 transitions. [2020-02-10 19:46:23,330 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 352 transitions. Word has length 19 [2020-02-10 19:46:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,330 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 352 transitions. [2020-02-10 19:46:23,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 352 transitions. [2020-02-10 19:46:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:23,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:23,331 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash 270189236, now seen corresponding path program 539 times [2020-02-10 19:46:23,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245009471] [2020-02-10 19:46:23,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,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:46:23,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245009471] [2020-02-10 19:46:23,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:23,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638275708] [2020-02-10 19:46:23,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:23,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:23,514 INFO L87 Difference]: Start difference. First operand 132 states and 352 transitions. Second operand 8 states. [2020-02-10 19:46:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,589 INFO L93 Difference]: Finished difference Result 229 states and 514 transitions. [2020-02-10 19:46:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:23,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,590 INFO L225 Difference]: With dead ends: 229 [2020-02-10 19:46:23,590 INFO L226 Difference]: Without dead ends: 219 [2020-02-10 19:46:23,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-02-10 19:46:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 134. [2020-02-10 19:46:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 19:46:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2020-02-10 19:46:23,594 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 19 [2020-02-10 19:46:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,594 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2020-02-10 19:46:23,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2020-02-10 19:46:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:23,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:23,595 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1458858098, now seen corresponding path program 540 times [2020-02-10 19:46:23,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518850026] [2020-02-10 19:46:23,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,771 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:46:23,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518850026] [2020-02-10 19:46:23,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:23,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316571945] [2020-02-10 19:46:23,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:23,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:23,772 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 8 states. [2020-02-10 19:46:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,858 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-02-10 19:46:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:23,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,859 INFO L225 Difference]: With dead ends: 223 [2020-02-10 19:46:23,859 INFO L226 Difference]: Without dead ends: 205 [2020-02-10 19:46:23,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-02-10 19:46:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2020-02-10 19:46:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 19:46:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 345 transitions. [2020-02-10 19:46:23,862 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 345 transitions. Word has length 19 [2020-02-10 19:46:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,863 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 345 transitions. [2020-02-10 19:46:23,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 345 transitions. [2020-02-10 19:46:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:23,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:23,863 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1337500568, now seen corresponding path program 541 times [2020-02-10 19:46:23,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67081779] [2020-02-10 19:46:23,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,062 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:46:24,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67081779] [2020-02-10 19:46:24,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:24,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111095879] [2020-02-10 19:46:24,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:24,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:24,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:24,063 INFO L87 Difference]: Start difference. First operand 129 states and 345 transitions. Second operand 8 states. [2020-02-10 19:46:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,128 INFO L93 Difference]: Finished difference Result 243 states and 557 transitions. [2020-02-10 19:46:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:24,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,129 INFO L225 Difference]: With dead ends: 243 [2020-02-10 19:46:24,129 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 19:46:24,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 19:46:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 139. [2020-02-10 19:46:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-02-10 19:46:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 373 transitions. [2020-02-10 19:46:24,132 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 373 transitions. Word has length 19 [2020-02-10 19:46:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,132 INFO L479 AbstractCegarLoop]: Abstraction has 139 states and 373 transitions. [2020-02-10 19:46:24,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 373 transitions. [2020-02-10 19:46:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:24,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:24,133 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2088562662, now seen corresponding path program 542 times [2020-02-10 19:46:24,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402216275] [2020-02-10 19:46:24,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,329 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:46:24,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402216275] [2020-02-10 19:46:24,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:24,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921624313] [2020-02-10 19:46:24,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:24,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:24,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:24,331 INFO L87 Difference]: Start difference. First operand 139 states and 373 transitions. Second operand 8 states. [2020-02-10 19:46:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,419 INFO L93 Difference]: Finished difference Result 239 states and 545 transitions. [2020-02-10 19:46:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:24,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,420 INFO L225 Difference]: With dead ends: 239 [2020-02-10 19:46:24,420 INFO L226 Difference]: Without dead ends: 222 [2020-02-10 19:46:24,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-02-10 19:46:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 134. [2020-02-10 19:46:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 19:46:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 359 transitions. [2020-02-10 19:46:24,424 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 359 transitions. Word has length 19 [2020-02-10 19:46:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,424 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 359 transitions. [2020-02-10 19:46:24,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 359 transitions. [2020-02-10 19:46:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:24,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,424 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:24,424 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1357028874, now seen corresponding path program 543 times [2020-02-10 19:46:24,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854289136] [2020-02-10 19:46:24,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:24,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854289136] [2020-02-10 19:46:24,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:24,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610067032] [2020-02-10 19:46:24,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:24,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:24,622 INFO L87 Difference]: Start difference. First operand 134 states and 359 transitions. Second operand 8 states. [2020-02-10 19:46:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,687 INFO L93 Difference]: Finished difference Result 231 states and 525 transitions. [2020-02-10 19:46:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:24,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,688 INFO L225 Difference]: With dead ends: 231 [2020-02-10 19:46:24,688 INFO L226 Difference]: Without dead ends: 215 [2020-02-10 19:46:24,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-02-10 19:46:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2020-02-10 19:46:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-02-10 19:46:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 370 transitions. [2020-02-10 19:46:24,692 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 370 transitions. Word has length 19 [2020-02-10 19:46:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,692 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 370 transitions. [2020-02-10 19:46:24,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 370 transitions. [2020-02-10 19:46:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:24,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:24,693 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash 380824124, now seen corresponding path program 544 times [2020-02-10 19:46:24,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238389872] [2020-02-10 19:46:24,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,882 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:46:24,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238389872] [2020-02-10 19:46:24,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:24,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106430383] [2020-02-10 19:46:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:24,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:24,884 INFO L87 Difference]: Start difference. First operand 140 states and 370 transitions. Second operand 8 states. [2020-02-10 19:46:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,967 INFO L93 Difference]: Finished difference Result 219 states and 505 transitions. [2020-02-10 19:46:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:24,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,968 INFO L225 Difference]: With dead ends: 219 [2020-02-10 19:46:24,968 INFO L226 Difference]: Without dead ends: 200 [2020-02-10 19:46:24,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-02-10 19:46:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2020-02-10 19:46:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-02-10 19:46:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 354 transitions. [2020-02-10 19:46:24,972 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 354 transitions. Word has length 19 [2020-02-10 19:46:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,972 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 354 transitions. [2020-02-10 19:46:24,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 354 transitions. [2020-02-10 19:46:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:24,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:24,972 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2008828456, now seen corresponding path program 545 times [2020-02-10 19:46:24,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367949499] [2020-02-10 19:46:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:25,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:46:25,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367949499] [2020-02-10 19:46:25,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:25,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:25,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191363165] [2020-02-10 19:46:25,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:25,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:25,167 INFO L87 Difference]: Start difference. First operand 134 states and 354 transitions. Second operand 8 states. [2020-02-10 19:46:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,253 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-02-10 19:46:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:25,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,254 INFO L225 Difference]: With dead ends: 216 [2020-02-10 19:46:25,254 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 19:46:25,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 19:46:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2020-02-10 19:46:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-02-10 19:46:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 362 transitions. [2020-02-10 19:46:25,258 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 362 transitions. Word has length 19 [2020-02-10 19:46:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,258 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 362 transitions. [2020-02-10 19:46:25,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 362 transitions. [2020-02-10 19:46:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:25,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:25,258 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1427264310, now seen corresponding path program 546 times [2020-02-10 19:46:25,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8667944] [2020-02-10 19:46:25,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:25,454 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:46:25,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8667944] [2020-02-10 19:46:25,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:25,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:25,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910376338] [2020-02-10 19:46:25,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:25,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:25,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:25,456 INFO L87 Difference]: Start difference. First operand 138 states and 362 transitions. Second operand 8 states. [2020-02-10 19:46:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,539 INFO L93 Difference]: Finished difference Result 203 states and 478 transitions. [2020-02-10 19:46:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:25,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,540 INFO L225 Difference]: With dead ends: 203 [2020-02-10 19:46:25,540 INFO L226 Difference]: Without dead ends: 181 [2020-02-10 19:46:25,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-02-10 19:46:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2020-02-10 19:46:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 19:46:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 342 transitions. [2020-02-10 19:46:25,543 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 342 transitions. Word has length 19 [2020-02-10 19:46:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,543 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 342 transitions. [2020-02-10 19:46:25,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 342 transitions. [2020-02-10 19:46:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:25,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,543 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:25,543 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1173836118, now seen corresponding path program 547 times [2020-02-10 19:46:25,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717604550] [2020-02-10 19:46:25,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:25,737 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:46:25,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717604550] [2020-02-10 19:46:25,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:25,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:25,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678378723] [2020-02-10 19:46:25,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:25,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:25,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:25,738 INFO L87 Difference]: Start difference. First operand 129 states and 342 transitions. Second operand 8 states. [2020-02-10 19:46:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,823 INFO L93 Difference]: Finished difference Result 221 states and 497 transitions. [2020-02-10 19:46:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:25,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,824 INFO L225 Difference]: With dead ends: 221 [2020-02-10 19:46:25,824 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 19:46:25,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 19:46:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2020-02-10 19:46:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-02-10 19:46:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 352 transitions. [2020-02-10 19:46:25,828 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 352 transitions. Word has length 19 [2020-02-10 19:46:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,829 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 352 transitions. [2020-02-10 19:46:25,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 352 transitions. [2020-02-10 19:46:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:25,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:25,829 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:25,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1410517870, now seen corresponding path program 548 times [2020-02-10 19:46:25,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5419372] [2020-02-10 19:46:25,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,023 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:46:26,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5419372] [2020-02-10 19:46:26,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:26,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888487951] [2020-02-10 19:46:26,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:26,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:26,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:26,024 INFO L87 Difference]: Start difference. First operand 133 states and 352 transitions. Second operand 8 states. [2020-02-10 19:46:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,120 INFO L93 Difference]: Finished difference Result 223 states and 500 transitions. [2020-02-10 19:46:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:26,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,121 INFO L225 Difference]: With dead ends: 223 [2020-02-10 19:46:26,121 INFO L226 Difference]: Without dead ends: 209 [2020-02-10 19:46:26,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-02-10 19:46:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 131. [2020-02-10 19:46:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 19:46:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 347 transitions. [2020-02-10 19:46:26,125 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 347 transitions. Word has length 19 [2020-02-10 19:46:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,125 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 347 transitions. [2020-02-10 19:46:26,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 347 transitions. [2020-02-10 19:46:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:26,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,125 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1918538616, now seen corresponding path program 549 times [2020-02-10 19:46:26,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384316608] [2020-02-10 19:46:26,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,322 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:46:26,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384316608] [2020-02-10 19:46:26,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:26,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474043892] [2020-02-10 19:46:26,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:26,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:26,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:26,324 INFO L87 Difference]: Start difference. First operand 131 states and 347 transitions. Second operand 8 states. [2020-02-10 19:46:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,409 INFO L93 Difference]: Finished difference Result 218 states and 489 transitions. [2020-02-10 19:46:26,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:26,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,410 INFO L225 Difference]: With dead ends: 218 [2020-02-10 19:46:26,410 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 19:46:26,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 19:46:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2020-02-10 19:46:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-02-10 19:46:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 350 transitions. [2020-02-10 19:46:26,414 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 350 transitions. Word has length 19 [2020-02-10 19:46:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,414 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 350 transitions. [2020-02-10 19:46:26,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 350 transitions. [2020-02-10 19:46:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:26,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,415 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash 189491282, now seen corresponding path program 550 times [2020-02-10 19:46:26,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059044211] [2020-02-10 19:46:26,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,598 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:46:26,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059044211] [2020-02-10 19:46:26,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:26,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509627529] [2020-02-10 19:46:26,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:26,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:26,600 INFO L87 Difference]: Start difference. First operand 133 states and 350 transitions. Second operand 8 states. [2020-02-10 19:46:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,682 INFO L93 Difference]: Finished difference Result 212 states and 485 transitions. [2020-02-10 19:46:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:26,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,683 INFO L225 Difference]: With dead ends: 212 [2020-02-10 19:46:26,683 INFO L226 Difference]: Without dead ends: 197 [2020-02-10 19:46:26,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-02-10 19:46:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2020-02-10 19:46:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 19:46:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 345 transitions. [2020-02-10 19:46:26,687 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 345 transitions. Word has length 19 [2020-02-10 19:46:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,687 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 345 transitions. [2020-02-10 19:46:26,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 345 transitions. [2020-02-10 19:46:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:26,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,688 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash 823589624, now seen corresponding path program 551 times [2020-02-10 19:46:26,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104270357] [2020-02-10 19:46:26,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,882 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:46:26,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104270357] [2020-02-10 19:46:26,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:26,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461212535] [2020-02-10 19:46:26,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:26,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:26,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:26,884 INFO L87 Difference]: Start difference. First operand 131 states and 345 transitions. Second operand 8 states. [2020-02-10 19:46:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,965 INFO L93 Difference]: Finished difference Result 213 states and 490 transitions. [2020-02-10 19:46:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:26,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,966 INFO L225 Difference]: With dead ends: 213 [2020-02-10 19:46:26,966 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 19:46:26,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 19:46:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2020-02-10 19:46:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-02-10 19:46:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 353 transitions. [2020-02-10 19:46:26,969 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 353 transitions. Word has length 19 [2020-02-10 19:46:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,969 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 353 transitions. [2020-02-10 19:46:26,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 353 transitions. [2020-02-10 19:46:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:26,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,970 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1678896278, now seen corresponding path program 552 times [2020-02-10 19:46:26,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324490905] [2020-02-10 19:46:26,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,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:46:27,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324490905] [2020-02-10 19:46:27,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:27,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418982142] [2020-02-10 19:46:27,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:27,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:27,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:27,167 INFO L87 Difference]: Start difference. First operand 135 states and 353 transitions. Second operand 8 states. [2020-02-10 19:46:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,250 INFO L93 Difference]: Finished difference Result 200 states and 469 transitions. [2020-02-10 19:46:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:27,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,251 INFO L225 Difference]: With dead ends: 200 [2020-02-10 19:46:27,251 INFO L226 Difference]: Without dead ends: 178 [2020-02-10 19:46:27,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-02-10 19:46:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2020-02-10 19:46:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 19:46:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 336 transitions. [2020-02-10 19:46:27,254 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 336 transitions. Word has length 19 [2020-02-10 19:46:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,255 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 336 transitions. [2020-02-10 19:46:27,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 336 transitions. [2020-02-10 19:46:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:27,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:27,255 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash 283350700, now seen corresponding path program 553 times [2020-02-10 19:46:27,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611624243] [2020-02-10 19:46:27,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,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:46:27,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611624243] [2020-02-10 19:46:27,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:27,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384474582] [2020-02-10 19:46:27,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:27,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:27,450 INFO L87 Difference]: Start difference. First operand 126 states and 336 transitions. Second operand 8 states. [2020-02-10 19:46:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,509 INFO L93 Difference]: Finished difference Result 220 states and 486 transitions. [2020-02-10 19:46:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:27,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,510 INFO L225 Difference]: With dead ends: 220 [2020-02-10 19:46:27,510 INFO L226 Difference]: Without dead ends: 204 [2020-02-10 19:46:27,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-02-10 19:46:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 129. [2020-02-10 19:46:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-02-10 19:46:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 340 transitions. [2020-02-10 19:46:27,513 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 340 transitions. Word has length 19 [2020-02-10 19:46:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,514 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 340 transitions. [2020-02-10 19:46:27,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 340 transitions. [2020-02-10 19:46:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:27,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:27,514 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash 542408926, now seen corresponding path program 554 times [2020-02-10 19:46:27,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540456584] [2020-02-10 19:46:27,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,713 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:46:27,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540456584] [2020-02-10 19:46:27,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:27,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788310086] [2020-02-10 19:46:27,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:27,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:27,715 INFO L87 Difference]: Start difference. First operand 129 states and 340 transitions. Second operand 8 states. [2020-02-10 19:46:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,782 INFO L93 Difference]: Finished difference Result 214 states and 471 transitions. [2020-02-10 19:46:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:27,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,783 INFO L225 Difference]: With dead ends: 214 [2020-02-10 19:46:27,783 INFO L226 Difference]: Without dead ends: 201 [2020-02-10 19:46:27,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-02-10 19:46:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 126. [2020-02-10 19:46:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 19:46:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 333 transitions. [2020-02-10 19:46:27,786 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 333 transitions. Word has length 19 [2020-02-10 19:46:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,786 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 333 transitions. [2020-02-10 19:46:27,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 333 transitions. [2020-02-10 19:46:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:27,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:27,787 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1317087154, now seen corresponding path program 555 times [2020-02-10 19:46:27,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821217665] [2020-02-10 19:46:27,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,002 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:46:28,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821217665] [2020-02-10 19:46:28,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:28,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156976262] [2020-02-10 19:46:28,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:28,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:28,003 INFO L87 Difference]: Start difference. First operand 126 states and 333 transitions. Second operand 8 states. [2020-02-10 19:46:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,068 INFO L93 Difference]: Finished difference Result 224 states and 495 transitions. [2020-02-10 19:46:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:28,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,069 INFO L225 Difference]: With dead ends: 224 [2020-02-10 19:46:28,069 INFO L226 Difference]: Without dead ends: 208 [2020-02-10 19:46:28,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-02-10 19:46:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2020-02-10 19:46:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-02-10 19:46:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 342 transitions. [2020-02-10 19:46:28,073 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 342 transitions. Word has length 19 [2020-02-10 19:46:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,073 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 342 transitions. [2020-02-10 19:46:28,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 342 transitions. [2020-02-10 19:46:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:28,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:28,074 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2068149248, now seen corresponding path program 556 times [2020-02-10 19:46:28,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726384167] [2020-02-10 19:46:28,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,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:46:28,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726384167] [2020-02-10 19:46:28,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:28,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123623342] [2020-02-10 19:46:28,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:28,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:28,272 INFO L87 Difference]: Start difference. First operand 131 states and 342 transitions. Second operand 8 states. [2020-02-10 19:46:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,353 INFO L93 Difference]: Finished difference Result 220 states and 483 transitions. [2020-02-10 19:46:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:28,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,354 INFO L225 Difference]: With dead ends: 220 [2020-02-10 19:46:28,354 INFO L226 Difference]: Without dead ends: 203 [2020-02-10 19:46:28,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-02-10 19:46:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2020-02-10 19:46:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 19:46:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 330 transitions. [2020-02-10 19:46:28,358 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 330 transitions. Word has length 19 [2020-02-10 19:46:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,358 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 330 transitions. [2020-02-10 19:46:28,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 330 transitions. [2020-02-10 19:46:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:28,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:28,359 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -916665526, now seen corresponding path program 557 times [2020-02-10 19:46:28,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308261611] [2020-02-10 19:46:28,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:28,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308261611] [2020-02-10 19:46:28,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:28,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353868077] [2020-02-10 19:46:28,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:28,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:28,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:28,563 INFO L87 Difference]: Start difference. First operand 126 states and 330 transitions. Second operand 8 states. [2020-02-10 19:46:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,633 INFO L93 Difference]: Finished difference Result 209 states and 459 transitions. [2020-02-10 19:46:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:28,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,634 INFO L225 Difference]: With dead ends: 209 [2020-02-10 19:46:28,634 INFO L226 Difference]: Without dead ends: 199 [2020-02-10 19:46:28,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-02-10 19:46:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2020-02-10 19:46:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-02-10 19:46:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 333 transitions. [2020-02-10 19:46:28,637 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 333 transitions. Word has length 19 [2020-02-10 19:46:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,638 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 333 transitions. [2020-02-10 19:46:28,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 333 transitions. [2020-02-10 19:46:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:28,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:28,638 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1771972180, now seen corresponding path program 558 times [2020-02-10 19:46:28,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174515402] [2020-02-10 19:46:28,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,834 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:46:28,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174515402] [2020-02-10 19:46:28,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:28,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708202340] [2020-02-10 19:46:28,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:28,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:28,835 INFO L87 Difference]: Start difference. First operand 128 states and 333 transitions. Second operand 8 states. [2020-02-10 19:46:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,920 INFO L93 Difference]: Finished difference Result 211 states and 462 transitions. [2020-02-10 19:46:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:28,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,921 INFO L225 Difference]: With dead ends: 211 [2020-02-10 19:46:28,921 INFO L226 Difference]: Without dead ends: 194 [2020-02-10 19:46:28,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-02-10 19:46:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 123. [2020-02-10 19:46:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-02-10 19:46:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 323 transitions. [2020-02-10 19:46:28,925 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 323 transitions. Word has length 19 [2020-02-10 19:46:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,925 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 323 transitions. [2020-02-10 19:46:28,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 323 transitions. [2020-02-10 19:46:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:28,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:28,929 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2085582518, now seen corresponding path program 559 times [2020-02-10 19:46:28,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360386104] [2020-02-10 19:46:28,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,117 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:46:29,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360386104] [2020-02-10 19:46:29,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:29,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531768949] [2020-02-10 19:46:29,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:29,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:29,119 INFO L87 Difference]: Start difference. First operand 123 states and 323 transitions. Second operand 8 states. [2020-02-10 19:46:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,182 INFO L93 Difference]: Finished difference Result 215 states and 468 transitions. [2020-02-10 19:46:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:29,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,183 INFO L225 Difference]: With dead ends: 215 [2020-02-10 19:46:29,183 INFO L226 Difference]: Without dead ends: 199 [2020-02-10 19:46:29,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-02-10 19:46:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2020-02-10 19:46:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-02-10 19:46:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 320 transitions. [2020-02-10 19:46:29,187 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 320 transitions. Word has length 19 [2020-02-10 19:46:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,187 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 320 transitions. [2020-02-10 19:46:29,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 320 transitions. [2020-02-10 19:46:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:29,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:29,188 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1826524292, now seen corresponding path program 560 times [2020-02-10 19:46:29,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306384874] [2020-02-10 19:46:29,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,369 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:46:29,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306384874] [2020-02-10 19:46:29,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:29,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419086375] [2020-02-10 19:46:29,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:29,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:29,370 INFO L87 Difference]: Start difference. First operand 123 states and 320 transitions. Second operand 8 states. [2020-02-10 19:46:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,433 INFO L93 Difference]: Finished difference Result 209 states and 453 transitions. [2020-02-10 19:46:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:29,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,434 INFO L225 Difference]: With dead ends: 209 [2020-02-10 19:46:29,434 INFO L226 Difference]: Without dead ends: 196 [2020-02-10 19:46:29,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-02-10 19:46:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 120. [2020-02-10 19:46:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-02-10 19:46:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2020-02-10 19:46:29,437 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 19 [2020-02-10 19:46:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,438 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2020-02-10 19:46:29,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2020-02-10 19:46:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:29,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:29,438 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash -991490930, now seen corresponding path program 561 times [2020-02-10 19:46:29,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157768766] [2020-02-10 19:46:29,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,631 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:46:29,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157768766] [2020-02-10 19:46:29,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:29,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759572896] [2020-02-10 19:46:29,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:29,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:29,632 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand 8 states. [2020-02-10 19:46:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,695 INFO L93 Difference]: Finished difference Result 213 states and 467 transitions. [2020-02-10 19:46:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:29,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,696 INFO L225 Difference]: With dead ends: 213 [2020-02-10 19:46:29,696 INFO L226 Difference]: Without dead ends: 197 [2020-02-10 19:46:29,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-02-10 19:46:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 126. [2020-02-10 19:46:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-02-10 19:46:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 324 transitions. [2020-02-10 19:46:29,699 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 324 transitions. Word has length 19 [2020-02-10 19:46:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,700 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 324 transitions. [2020-02-10 19:46:29,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 324 transitions. [2020-02-10 19:46:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:29,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:29,700 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1967695680, now seen corresponding path program 562 times [2020-02-10 19:46:29,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337196549] [2020-02-10 19:46:29,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,891 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:46:29,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337196549] [2020-02-10 19:46:29,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:29,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077080580] [2020-02-10 19:46:29,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:29,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:29,892 INFO L87 Difference]: Start difference. First operand 126 states and 324 transitions. Second operand 8 states. [2020-02-10 19:46:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,972 INFO L93 Difference]: Finished difference Result 201 states and 447 transitions. [2020-02-10 19:46:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:29,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,973 INFO L225 Difference]: With dead ends: 201 [2020-02-10 19:46:29,973 INFO L226 Difference]: Without dead ends: 182 [2020-02-10 19:46:29,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-02-10 19:46:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2020-02-10 19:46:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-02-10 19:46:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 310 transitions. [2020-02-10 19:46:29,976 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 310 transitions. Word has length 19 [2020-02-10 19:46:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,977 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 310 transitions. [2020-02-10 19:46:29,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 310 transitions. [2020-02-10 19:46:29,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:29,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:29,978 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1019871656, now seen corresponding path program 563 times [2020-02-10 19:46:29,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453446489] [2020-02-10 19:46:29,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,163 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:46:30,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453446489] [2020-02-10 19:46:30,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:30,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171029676] [2020-02-10 19:46:30,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:30,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:30,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:30,165 INFO L87 Difference]: Start difference. First operand 120 states and 310 transitions. Second operand 8 states. [2020-02-10 19:46:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,231 INFO L93 Difference]: Finished difference Result 203 states and 440 transitions. [2020-02-10 19:46:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:30,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,232 INFO L225 Difference]: With dead ends: 203 [2020-02-10 19:46:30,232 INFO L226 Difference]: Without dead ends: 193 [2020-02-10 19:46:30,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-02-10 19:46:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 122. [2020-02-10 19:46:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-02-10 19:46:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 313 transitions. [2020-02-10 19:46:30,235 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 313 transitions. Word has length 19 [2020-02-10 19:46:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,236 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 313 transitions. [2020-02-10 19:46:30,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 313 transitions. [2020-02-10 19:46:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:30,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:30,236 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1785690644, now seen corresponding path program 564 times [2020-02-10 19:46:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334189467] [2020-02-10 19:46:30,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,421 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:46:30,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334189467] [2020-02-10 19:46:30,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:30,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582418884] [2020-02-10 19:46:30,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:30,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:30,422 INFO L87 Difference]: Start difference. First operand 122 states and 313 transitions. Second operand 8 states. [2020-02-10 19:46:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,497 INFO L93 Difference]: Finished difference Result 197 states and 436 transitions. [2020-02-10 19:46:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:30,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,498 INFO L225 Difference]: With dead ends: 197 [2020-02-10 19:46:30,498 INFO L226 Difference]: Without dead ends: 179 [2020-02-10 19:46:30,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-02-10 19:46:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2020-02-10 19:46:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-02-10 19:46:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 303 transitions. [2020-02-10 19:46:30,502 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 303 transitions. Word has length 19 [2020-02-10 19:46:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,502 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 303 transitions. [2020-02-10 19:46:30,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 303 transitions. [2020-02-10 19:46:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:30,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:30,503 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1759986294, now seen corresponding path program 565 times [2020-02-10 19:46:30,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021751020] [2020-02-10 19:46:30,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,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:46:30,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021751020] [2020-02-10 19:46:30,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:30,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994711293] [2020-02-10 19:46:30,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:30,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:30,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:30,734 INFO L87 Difference]: Start difference. First operand 117 states and 303 transitions. Second operand 8 states. [2020-02-10 19:46:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,796 INFO L93 Difference]: Finished difference Result 207 states and 450 transitions. [2020-02-10 19:46:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:30,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,797 INFO L225 Difference]: With dead ends: 207 [2020-02-10 19:46:30,798 INFO L226 Difference]: Without dead ends: 191 [2020-02-10 19:46:30,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-02-10 19:46:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2020-02-10 19:46:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-02-10 19:46:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 298 transitions. [2020-02-10 19:46:30,801 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 298 transitions. Word has length 19 [2020-02-10 19:46:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,801 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 298 transitions. [2020-02-10 19:46:30,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 298 transitions. [2020-02-10 19:46:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:30,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:30,802 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1783918908, now seen corresponding path program 566 times [2020-02-10 19:46:30,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775280066] [2020-02-10 19:46:30,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,995 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:46:30,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775280066] [2020-02-10 19:46:30,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:30,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499189250] [2020-02-10 19:46:30,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:30,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:30,996 INFO L87 Difference]: Start difference. First operand 117 states and 298 transitions. Second operand 8 states. [2020-02-10 19:46:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,079 INFO L93 Difference]: Finished difference Result 203 states and 438 transitions. [2020-02-10 19:46:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:31,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,080 INFO L225 Difference]: With dead ends: 203 [2020-02-10 19:46:31,080 INFO L226 Difference]: Without dead ends: 186 [2020-02-10 19:46:31,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-02-10 19:46:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2020-02-10 19:46:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-02-10 19:46:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 284 transitions. [2020-02-10 19:46:31,083 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 284 transitions. Word has length 19 [2020-02-10 19:46:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,084 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 284 transitions. [2020-02-10 19:46:31,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 284 transitions. [2020-02-10 19:46:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:31,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:31,084 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash 934543148, now seen corresponding path program 567 times [2020-02-10 19:46:31,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548372362] [2020-02-10 19:46:31,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:31,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548372362] [2020-02-10 19:46:31,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:31,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606681122] [2020-02-10 19:46:31,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:31,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:31,283 INFO L87 Difference]: Start difference. First operand 112 states and 284 transitions. Second operand 8 states. [2020-02-10 19:46:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,341 INFO L93 Difference]: Finished difference Result 195 states and 418 transitions. [2020-02-10 19:46:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:31,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,342 INFO L225 Difference]: With dead ends: 195 [2020-02-10 19:46:31,342 INFO L226 Difference]: Without dead ends: 179 [2020-02-10 19:46:31,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-02-10 19:46:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 104. [2020-02-10 19:46:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 19:46:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 263 transitions. [2020-02-10 19:46:31,344 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 263 transitions. Word has length 19 [2020-02-10 19:46:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,345 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 263 transitions. [2020-02-10 19:46:31,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 263 transitions. [2020-02-10 19:46:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:31,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:31,345 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash -41661602, now seen corresponding path program 568 times [2020-02-10 19:46:31,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561050134] [2020-02-10 19:46:31,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,549 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:46:31,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561050134] [2020-02-10 19:46:31,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:31,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393005897] [2020-02-10 19:46:31,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:31,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:31,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:31,551 INFO L87 Difference]: Start difference. First operand 104 states and 263 transitions. Second operand 8 states. [2020-02-10 19:46:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,634 INFO L93 Difference]: Finished difference Result 183 states and 398 transitions. [2020-02-10 19:46:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:31,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,635 INFO L225 Difference]: With dead ends: 183 [2020-02-10 19:46:31,636 INFO L226 Difference]: Without dead ends: 164 [2020-02-10 19:46:31,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-02-10 19:46:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 98. [2020-02-10 19:46:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 19:46:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-02-10 19:46:31,638 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 19 [2020-02-10 19:46:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,638 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-02-10 19:46:31,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-02-10 19:46:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:31,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,639 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:31,639 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1586342730, now seen corresponding path program 569 times [2020-02-10 19:46:31,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086687282] [2020-02-10 19:46:31,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,833 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:46:31,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086687282] [2020-02-10 19:46:31,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:31,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179976441] [2020-02-10 19:46:31,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:31,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:31,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:31,835 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 8 states. [2020-02-10 19:46:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,916 INFO L93 Difference]: Finished difference Result 180 states and 392 transitions. [2020-02-10 19:46:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:31,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,917 INFO L225 Difference]: With dead ends: 180 [2020-02-10 19:46:31,917 INFO L226 Difference]: Without dead ends: 168 [2020-02-10 19:46:31,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-02-10 19:46:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 102. [2020-02-10 19:46:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-02-10 19:46:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2020-02-10 19:46:31,920 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 19 [2020-02-10 19:46:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,920 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 255 transitions. [2020-02-10 19:46:31,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 255 transitions. [2020-02-10 19:46:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:31,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:31,921 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1849750036, now seen corresponding path program 570 times [2020-02-10 19:46:31,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200748368] [2020-02-10 19:46:31,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,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:46:32,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200748368] [2020-02-10 19:46:32,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:32,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385091608] [2020-02-10 19:46:32,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:32,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:32,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:32,113 INFO L87 Difference]: Start difference. First operand 102 states and 255 transitions. Second operand 8 states. [2020-02-10 19:46:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,200 INFO L93 Difference]: Finished difference Result 167 states and 371 transitions. [2020-02-10 19:46:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:32,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,201 INFO L225 Difference]: With dead ends: 167 [2020-02-10 19:46:32,201 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:32,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 19:46:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-02-10 19:46:32,204 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-02-10 19:46:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,204 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-02-10 19:46:32,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-02-10 19:46:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:32,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:32,205 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1422262942, now seen corresponding path program 571 times [2020-02-10 19:46:32,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925631629] [2020-02-10 19:46:32,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,403 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:46:32,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925631629] [2020-02-10 19:46:32,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:32,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742258912] [2020-02-10 19:46:32,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:32,405 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-02-10 19:46:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,474 INFO L93 Difference]: Finished difference Result 172 states and 373 transitions. [2020-02-10 19:46:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:32,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,475 INFO L225 Difference]: With dead ends: 172 [2020-02-10 19:46:32,475 INFO L226 Difference]: Without dead ends: 162 [2020-02-10 19:46:32,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-02-10 19:46:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2020-02-10 19:46:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:46:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 245 transitions. [2020-02-10 19:46:32,478 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 245 transitions. Word has length 19 [2020-02-10 19:46:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,478 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 245 transitions. [2020-02-10 19:46:32,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 245 transitions. [2020-02-10 19:46:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:32,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,479 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:32,479 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash 566956288, now seen corresponding path program 572 times [2020-02-10 19:46:32,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737932471] [2020-02-10 19:46:32,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,672 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:46:32,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737932471] [2020-02-10 19:46:32,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:32,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136470157] [2020-02-10 19:46:32,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:32,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:32,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:32,674 INFO L87 Difference]: Start difference. First operand 97 states and 245 transitions. Second operand 8 states. [2020-02-10 19:46:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,754 INFO L93 Difference]: Finished difference Result 174 states and 376 transitions. [2020-02-10 19:46:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:32,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,755 INFO L225 Difference]: With dead ends: 174 [2020-02-10 19:46:32,755 INFO L226 Difference]: Without dead ends: 160 [2020-02-10 19:46:32,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-02-10 19:46:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2020-02-10 19:46:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:46:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-02-10 19:46:32,758 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-02-10 19:46:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,759 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-02-10 19:46:32,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-02-10 19:46:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:32,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:32,759 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 573 times [2020-02-10 19:46:32,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542494926] [2020-02-10 19:46:32,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,955 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:46:32,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542494926] [2020-02-10 19:46:32,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:32,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639071024] [2020-02-10 19:46:32,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:32,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:32,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:32,957 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-02-10 19:46:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,027 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-02-10 19:46:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:33,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,028 INFO L225 Difference]: With dead ends: 168 [2020-02-10 19:46:33,029 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 19:46:33,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 19:46:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2020-02-10 19:46:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:46:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 243 transitions. [2020-02-10 19:46:33,032 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 243 transitions. Word has length 19 [2020-02-10 19:46:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,032 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 243 transitions. [2020-02-10 19:46:33,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 243 transitions. [2020-02-10 19:46:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:33,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:33,033 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash 227641600, now seen corresponding path program 574 times [2020-02-10 19:46:33,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569525072] [2020-02-10 19:46:33,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,222 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:46:33,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569525072] [2020-02-10 19:46:33,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:33,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482302112] [2020-02-10 19:46:33,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:33,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:33,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:33,223 INFO L87 Difference]: Start difference. First operand 97 states and 243 transitions. Second operand 8 states. [2020-02-10 19:46:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,308 INFO L93 Difference]: Finished difference Result 162 states and 359 transitions. [2020-02-10 19:46:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:33,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,309 INFO L225 Difference]: With dead ends: 162 [2020-02-10 19:46:33,309 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 19:46:33,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 19:46:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2020-02-10 19:46:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:46:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 19:46:33,312 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-02-10 19:46:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,312 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 19:46:33,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 19:46:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:33,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:33,313 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash -506129092, now seen corresponding path program 575 times [2020-02-10 19:46:33,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798159662] [2020-02-10 19:46:33,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,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:46:33,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798159662] [2020-02-10 19:46:33,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:33,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725841307] [2020-02-10 19:46:33,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:33,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:33,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:33,506 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-02-10 19:46:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,593 INFO L93 Difference]: Finished difference Result 155 states and 344 transitions. [2020-02-10 19:46:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:33,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,594 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:46:33,594 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 19:46:33,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 19:46:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 99. [2020-02-10 19:46:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 19:46:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 246 transitions. [2020-02-10 19:46:33,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 246 transitions. Word has length 19 [2020-02-10 19:46:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,597 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 246 transitions. [2020-02-10 19:46:33,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 246 transitions. [2020-02-10 19:46:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:33,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,598 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:33,598 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 576 times [2020-02-10 19:46:33,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866454257] [2020-02-10 19:46:33,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,795 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:46:33,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866454257] [2020-02-10 19:46:33,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:33,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612170416] [2020-02-10 19:46:33,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:33,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:33,796 INFO L87 Difference]: Start difference. First operand 99 states and 246 transitions. Second operand 8 states. [2020-02-10 19:46:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,882 INFO L93 Difference]: Finished difference Result 142 states and 323 transitions. [2020-02-10 19:46:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:33,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,883 INFO L225 Difference]: With dead ends: 142 [2020-02-10 19:46:33,883 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 19:46:33,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 19:46:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2020-02-10 19:46:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-02-10 19:46:33,886 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-02-10 19:46:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,886 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-02-10 19:46:33,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-02-10 19:46:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:33,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:33,887 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1776969654, now seen corresponding path program 577 times [2020-02-10 19:46:33,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702899822] [2020-02-10 19:46:33,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,100 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:46:34,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702899822] [2020-02-10 19:46:34,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:34,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888781524] [2020-02-10 19:46:34,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:34,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:34,102 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-02-10 19:46:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,189 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-02-10 19:46:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:34,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,190 INFO L225 Difference]: With dead ends: 165 [2020-02-10 19:46:34,190 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 19:46:34,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 19:46:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 93. [2020-02-10 19:46:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 237 transitions. [2020-02-10 19:46:34,193 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 237 transitions. Word has length 19 [2020-02-10 19:46:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,193 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 237 transitions. [2020-02-10 19:46:34,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 237 transitions. [2020-02-10 19:46:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:34,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:34,194 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2016611992, now seen corresponding path program 578 times [2020-02-10 19:46:34,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992908642] [2020-02-10 19:46:34,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,410 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:46:34,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992908642] [2020-02-10 19:46:34,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:34,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819912893] [2020-02-10 19:46:34,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:34,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:34,412 INFO L87 Difference]: Start difference. First operand 93 states and 237 transitions. Second operand 8 states. [2020-02-10 19:46:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,482 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-02-10 19:46:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:34,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,483 INFO L225 Difference]: With dead ends: 165 [2020-02-10 19:46:34,483 INFO L226 Difference]: Without dead ends: 154 [2020-02-10 19:46:34,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-02-10 19:46:34,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 92. [2020-02-10 19:46:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 235 transitions. [2020-02-10 19:46:34,486 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 235 transitions. Word has length 19 [2020-02-10 19:46:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,486 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 235 transitions. [2020-02-10 19:46:34,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 235 transitions. [2020-02-10 19:46:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:34,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:34,487 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1773295144, now seen corresponding path program 579 times [2020-02-10 19:46:34,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156039147] [2020-02-10 19:46:34,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,691 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:46:34,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156039147] [2020-02-10 19:46:34,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:34,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262584590] [2020-02-10 19:46:34,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:34,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:34,692 INFO L87 Difference]: Start difference. First operand 92 states and 235 transitions. Second operand 8 states. [2020-02-10 19:46:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,777 INFO L93 Difference]: Finished difference Result 168 states and 364 transitions. [2020-02-10 19:46:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:34,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,778 INFO L225 Difference]: With dead ends: 168 [2020-02-10 19:46:34,778 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 19:46:34,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 19:46:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-02-10 19:46:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 19:46:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 238 transitions. [2020-02-10 19:46:34,782 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 238 transitions. Word has length 19 [2020-02-10 19:46:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,782 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 238 transitions. [2020-02-10 19:46:34,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 238 transitions. [2020-02-10 19:46:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:34,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:34,783 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash -811058844, now seen corresponding path program 580 times [2020-02-10 19:46:34,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811981353] [2020-02-10 19:46:34,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,992 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:46:34,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811981353] [2020-02-10 19:46:34,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:34,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390960535] [2020-02-10 19:46:34,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:34,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:34,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:34,994 INFO L87 Difference]: Start difference. First operand 94 states and 238 transitions. Second operand 8 states. [2020-02-10 19:46:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,084 INFO L93 Difference]: Finished difference Result 170 states and 367 transitions. [2020-02-10 19:46:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:35,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,085 INFO L225 Difference]: With dead ends: 170 [2020-02-10 19:46:35,085 INFO L226 Difference]: Without dead ends: 156 [2020-02-10 19:46:35,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-02-10 19:46:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2020-02-10 19:46:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 19:46:35,088 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 19:46:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,088 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 19:46:35,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 19:46:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:35,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:35,089 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1205269924, now seen corresponding path program 581 times [2020-02-10 19:46:35,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766424359] [2020-02-10 19:46:35,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,299 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:46:35,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766424359] [2020-02-10 19:46:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:35,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890058313] [2020-02-10 19:46:35,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:35,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:35,301 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 19:46:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,373 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-02-10 19:46:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:35,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,374 INFO L225 Difference]: With dead ends: 168 [2020-02-10 19:46:35,374 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 19:46:35,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 19:46:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-02-10 19:46:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 19:46:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 19:46:35,377 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 19:46:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,377 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 19:46:35,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 19:46:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:35,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:35,377 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,378 INFO L82 PathProgramCache]: Analyzing trace with hash 349963270, now seen corresponding path program 582 times [2020-02-10 19:46:35,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055116755] [2020-02-10 19:46:35,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,583 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:46:35,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055116755] [2020-02-10 19:46:35,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:35,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308530700] [2020-02-10 19:46:35,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:35,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:35,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:35,585 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 19:46:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,666 INFO L93 Difference]: Finished difference Result 170 states and 366 transitions. [2020-02-10 19:46:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:35,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,667 INFO L225 Difference]: With dead ends: 170 [2020-02-10 19:46:35,667 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 19:46:35,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 19:46:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2020-02-10 19:46:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:46:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 232 transitions. [2020-02-10 19:46:35,670 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 232 transitions. Word has length 19 [2020-02-10 19:46:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,670 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 232 transitions. [2020-02-10 19:46:35,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 232 transitions. [2020-02-10 19:46:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:35,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:35,671 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 583 times [2020-02-10 19:46:35,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105978274] [2020-02-10 19:46:35,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,929 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:46:35,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105978274] [2020-02-10 19:46:35,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:35,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854998797] [2020-02-10 19:46:35,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:35,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:35,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:35,931 INFO L87 Difference]: Start difference. First operand 91 states and 232 transitions. Second operand 8 states. [2020-02-10 19:46:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,050 INFO L93 Difference]: Finished difference Result 163 states and 351 transitions. [2020-02-10 19:46:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:36,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,051 INFO L225 Difference]: With dead ends: 163 [2020-02-10 19:46:36,052 INFO L226 Difference]: Without dead ends: 153 [2020-02-10 19:46:36,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-02-10 19:46:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2020-02-10 19:46:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-02-10 19:46:36,056 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-02-10 19:46:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,056 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-02-10 19:46:36,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-02-10 19:46:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:36,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:36,057 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 584 times [2020-02-10 19:46:36,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664660853] [2020-02-10 19:46:36,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,302 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:46:36,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664660853] [2020-02-10 19:46:36,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:36,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348723647] [2020-02-10 19:46:36,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:36,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:36,303 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-02-10 19:46:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,375 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-02-10 19:46:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:36,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,376 INFO L225 Difference]: With dead ends: 163 [2020-02-10 19:46:36,376 INFO L226 Difference]: Without dead ends: 152 [2020-02-10 19:46:36,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-02-10 19:46:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2020-02-10 19:46:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 19:46:36,378 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 19:46:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,379 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 19:46:36,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 19:46:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:36,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:36,379 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash -155525592, now seen corresponding path program 585 times [2020-02-10 19:46:36,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586519547] [2020-02-10 19:46:36,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,578 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:46:36,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586519547] [2020-02-10 19:46:36,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:36,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052411104] [2020-02-10 19:46:36,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:36,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:36,580 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 19:46:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,671 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-02-10 19:46:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:36,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,672 INFO L225 Difference]: With dead ends: 165 [2020-02-10 19:46:36,672 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 19:46:36,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 19:46:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-02-10 19:46:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 19:46:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 19:46:36,675 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 19:46:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,675 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 19:46:36,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 19:46:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:36,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:36,676 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash 799453412, now seen corresponding path program 586 times [2020-02-10 19:46:36,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627132456] [2020-02-10 19:46:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,868 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:46:36,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627132456] [2020-02-10 19:46:36,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:36,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811099055] [2020-02-10 19:46:36,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:36,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:36,870 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 19:46:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,957 INFO L93 Difference]: Finished difference Result 159 states and 353 transitions. [2020-02-10 19:46:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:36,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,958 INFO L225 Difference]: With dead ends: 159 [2020-02-10 19:46:36,959 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 19:46:36,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 19:46:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2020-02-10 19:46:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-02-10 19:46:36,961 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-02-10 19:46:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,962 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-02-10 19:46:36,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-02-10 19:46:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:36,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:36,963 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1215773028, now seen corresponding path program 587 times [2020-02-10 19:46:36,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539096676] [2020-02-10 19:46:36,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,170 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:46:37,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539096676] [2020-02-10 19:46:37,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:37,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044756947] [2020-02-10 19:46:37,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:37,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:37,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:37,171 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-02-10 19:46:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,240 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-02-10 19:46:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:37,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,241 INFO L225 Difference]: With dead ends: 165 [2020-02-10 19:46:37,241 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 19:46:37,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 19:46:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-02-10 19:46:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 19:46:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-02-10 19:46:37,243 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-02-10 19:46:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,243 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-02-10 19:46:37,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-02-10 19:46:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:37,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:37,244 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1589789272, now seen corresponding path program 588 times [2020-02-10 19:46:37,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144408120] [2020-02-10 19:46:37,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,438 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:46:37,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144408120] [2020-02-10 19:46:37,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:37,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802197931] [2020-02-10 19:46:37,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:37,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:37,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:37,440 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-02-10 19:46:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,518 INFO L93 Difference]: Finished difference Result 159 states and 352 transitions. [2020-02-10 19:46:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:37,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,519 INFO L225 Difference]: With dead ends: 159 [2020-02-10 19:46:37,519 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 19:46:37,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 19:46:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2020-02-10 19:46:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:46:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-02-10 19:46:37,522 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-02-10 19:46:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,522 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-02-10 19:46:37,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-02-10 19:46:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:37,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:37,523 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:37,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1427580564, now seen corresponding path program 589 times [2020-02-10 19:46:37,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526267556] [2020-02-10 19:46:37,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,724 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:46:37,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526267556] [2020-02-10 19:46:37,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:37,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186744191] [2020-02-10 19:46:37,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:37,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:37,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:37,726 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-02-10 19:46:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,819 INFO L93 Difference]: Finished difference Result 161 states and 347 transitions. [2020-02-10 19:46:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:37,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,820 INFO L225 Difference]: With dead ends: 161 [2020-02-10 19:46:37,820 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 19:46:37,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 19:46:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 95. [2020-02-10 19:46:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:46:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-02-10 19:46:37,822 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 19 [2020-02-10 19:46:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,822 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-02-10 19:46:37,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-02-10 19:46:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:37,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:37,823 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,823 INFO L82 PathProgramCache]: Analyzing trace with hash 283032744, now seen corresponding path program 590 times [2020-02-10 19:46:37,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361426771] [2020-02-10 19:46:37,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:38,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361426771] [2020-02-10 19:46:38,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:38,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179115316] [2020-02-10 19:46:38,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:38,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:38,021 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 8 states. [2020-02-10 19:46:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,109 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-02-10 19:46:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:38,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,110 INFO L225 Difference]: With dead ends: 163 [2020-02-10 19:46:38,110 INFO L226 Difference]: Without dead ends: 149 [2020-02-10 19:46:38,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-02-10 19:46:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2020-02-10 19:46:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-02-10 19:46:38,113 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-02-10 19:46:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,114 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-02-10 19:46:38,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-02-10 19:46:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:38,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:38,115 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 591 times [2020-02-10 19:46:38,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674082635] [2020-02-10 19:46:38,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,317 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:46:38,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674082635] [2020-02-10 19:46:38,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:38,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053758912] [2020-02-10 19:46:38,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:38,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:38,319 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-02-10 19:46:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,408 INFO L93 Difference]: Finished difference Result 158 states and 339 transitions. [2020-02-10 19:46:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:38,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,409 INFO L225 Difference]: With dead ends: 158 [2020-02-10 19:46:38,409 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 19:46:38,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 19:46:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2020-02-10 19:46:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:46:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2020-02-10 19:46:38,412 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 19 [2020-02-10 19:46:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,412 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2020-02-10 19:46:38,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2020-02-10 19:46:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:38,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:38,413 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -811487546, now seen corresponding path program 592 times [2020-02-10 19:46:38,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054604050] [2020-02-10 19:46:38,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:38,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054604050] [2020-02-10 19:46:38,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:38,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117603591] [2020-02-10 19:46:38,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:38,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:38,610 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand 8 states. [2020-02-10 19:46:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,700 INFO L93 Difference]: Finished difference Result 152 states and 335 transitions. [2020-02-10 19:46:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:38,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,701 INFO L225 Difference]: With dead ends: 152 [2020-02-10 19:46:38,701 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 19:46:38,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 19:46:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2020-02-10 19:46:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 234 transitions. [2020-02-10 19:46:38,703 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 234 transitions. Word has length 19 [2020-02-10 19:46:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,704 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 234 transitions. [2020-02-10 19:46:38,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 234 transitions. [2020-02-10 19:46:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:38,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:38,704 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash -177389204, now seen corresponding path program 593 times [2020-02-10 19:46:38,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28872422] [2020-02-10 19:46:38,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,909 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:46:38,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28872422] [2020-02-10 19:46:38,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:38,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224315649] [2020-02-10 19:46:38,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:38,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:38,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:38,911 INFO L87 Difference]: Start difference. First operand 93 states and 234 transitions. Second operand 8 states. [2020-02-10 19:46:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,990 INFO L93 Difference]: Finished difference Result 153 states and 340 transitions. [2020-02-10 19:46:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:38,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,991 INFO L225 Difference]: With dead ends: 153 [2020-02-10 19:46:38,991 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 19:46:38,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 19:46:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2020-02-10 19:46:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:46:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-02-10 19:46:38,994 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 19 [2020-02-10 19:46:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,994 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-02-10 19:46:38,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-02-10 19:46:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:38,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,995 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:38,995 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 594 times [2020-02-10 19:46:38,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209345865] [2020-02-10 19:46:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:39,275 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2020-02-10 19:46:39,444 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:46:39,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209345865] [2020-02-10 19:46:39,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:39,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:39,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126102652] [2020-02-10 19:46:39,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:39,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:39,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:39,446 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 8 states. [2020-02-10 19:46:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,534 INFO L93 Difference]: Finished difference Result 140 states and 319 transitions. [2020-02-10 19:46:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:39,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,535 INFO L225 Difference]: With dead ends: 140 [2020-02-10 19:46:39,535 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 19:46:39,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 19:46:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2020-02-10 19:46:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:46:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-02-10 19:46:39,539 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-02-10 19:46:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,539 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-02-10 19:46:39,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-02-10 19:46:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:39,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:39,540 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash 698923658, now seen corresponding path program 595 times [2020-02-10 19:46:39,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936183698] [2020-02-10 19:46:39,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:39,764 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:46:39,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936183698] [2020-02-10 19:46:39,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:39,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:39,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785737099] [2020-02-10 19:46:39,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:39,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:39,766 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-02-10 19:46:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,821 INFO L93 Difference]: Finished difference Result 140 states and 309 transitions. [2020-02-10 19:46:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:39,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,821 INFO L225 Difference]: With dead ends: 140 [2020-02-10 19:46:39,822 INFO L226 Difference]: Without dead ends: 130 [2020-02-10 19:46:39,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-02-10 19:46:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2020-02-10 19:46:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:46:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-02-10 19:46:39,825 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-02-10 19:46:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,825 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-02-10 19:46:39,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-02-10 19:46:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:39,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:39,826 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -156382996, now seen corresponding path program 596 times [2020-02-10 19:46:39,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135927092] [2020-02-10 19:46:39,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,031 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:46:40,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135927092] [2020-02-10 19:46:40,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:40,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853582694] [2020-02-10 19:46:40,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:40,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:40,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:40,032 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-02-10 19:46:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,118 INFO L93 Difference]: Finished difference Result 142 states and 312 transitions. [2020-02-10 19:46:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:40,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,119 INFO L225 Difference]: With dead ends: 142 [2020-02-10 19:46:40,119 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 19:46:40,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 19:46:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2020-02-10 19:46:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-02-10 19:46:40,122 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-02-10 19:46:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,122 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-02-10 19:46:40,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-02-10 19:46:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:40,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,123 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:40,123 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 597 times [2020-02-10 19:46:40,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854193630] [2020-02-10 19:46:40,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,332 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:46:40,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854193630] [2020-02-10 19:46:40,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:40,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338201945] [2020-02-10 19:46:40,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:40,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:40,334 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-02-10 19:46:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,402 INFO L93 Difference]: Finished difference Result 136 states and 299 transitions. [2020-02-10 19:46:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:40,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,403 INFO L225 Difference]: With dead ends: 136 [2020-02-10 19:46:40,403 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 19:46:40,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 19:46:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2020-02-10 19:46:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 19:46:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 19:46:40,406 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-02-10 19:46:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,406 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 19:46:40,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 19:46:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:40,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:40,407 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash -495697684, now seen corresponding path program 598 times [2020-02-10 19:46:40,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502723579] [2020-02-10 19:46:40,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,607 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:46:40,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502723579] [2020-02-10 19:46:40,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:40,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933607026] [2020-02-10 19:46:40,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:40,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:40,609 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-02-10 19:46:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,693 INFO L93 Difference]: Finished difference Result 130 states and 295 transitions. [2020-02-10 19:46:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:40,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,694 INFO L225 Difference]: With dead ends: 130 [2020-02-10 19:46:40,694 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 19:46:40,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 19:46:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2020-02-10 19:46:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 233 transitions. [2020-02-10 19:46:40,697 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 233 transitions. Word has length 19 [2020-02-10 19:46:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,697 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 233 transitions. [2020-02-10 19:46:40,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 233 transitions. [2020-02-10 19:46:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:40,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:40,698 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1229468376, now seen corresponding path program 599 times [2020-02-10 19:46:40,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293603001] [2020-02-10 19:46:40,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,903 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:46:40,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293603001] [2020-02-10 19:46:40,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:40,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524084868] [2020-02-10 19:46:40,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:40,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:40,904 INFO L87 Difference]: Start difference. First operand 93 states and 233 transitions. Second operand 8 states. [2020-02-10 19:46:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,988 INFO L93 Difference]: Finished difference Result 123 states and 280 transitions. [2020-02-10 19:46:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:40,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,989 INFO L225 Difference]: With dead ends: 123 [2020-02-10 19:46:40,989 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 19:46:40,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 19:46:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2020-02-10 19:46:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 19:46:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-02-10 19:46:40,991 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 19 [2020-02-10 19:46:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,991 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-02-10 19:46:40,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-02-10 19:46:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:40,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:40,992 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 600 times [2020-02-10 19:46:40,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724762825] [2020-02-10 19:46:40,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,196 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:46:41,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724762825] [2020-02-10 19:46:41,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:41,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601276459] [2020-02-10 19:46:41,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:41,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:41,198 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 8 states. [2020-02-10 19:46:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,282 INFO L93 Difference]: Finished difference Result 110 states and 259 transitions. [2020-02-10 19:46:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:41,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,283 INFO L225 Difference]: With dead ends: 110 [2020-02-10 19:46:41,283 INFO L226 Difference]: Without dead ends: 88 [2020-02-10 19:46:41,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-02-10 19:46:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-02-10 19:46:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 225 transitions. [2020-02-10 19:46:41,285 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 225 transitions. Word has length 19 [2020-02-10 19:46:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,286 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 225 transitions. [2020-02-10 19:46:41,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 225 transitions. [2020-02-10 19:46:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:41,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:41,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:41,286 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1155542588, now seen corresponding path program 601 times [2020-02-10 19:46:41,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678314547] [2020-02-10 19:46:41,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,465 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:46:41,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678314547] [2020-02-10 19:46:41,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:41,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750501535] [2020-02-10 19:46:41,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:41,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:41,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:41,466 INFO L87 Difference]: Start difference. First operand 88 states and 225 transitions. Second operand 8 states. [2020-02-10 19:46:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,545 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-02-10 19:46:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:41,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,546 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:46:41,546 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 19:46:41,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 19:46:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-02-10 19:46:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:46:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-02-10 19:46:41,549 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-02-10 19:46:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,549 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-02-10 19:46:41,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-02-10 19:46:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:41,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:41,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:41,550 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 281207262, now seen corresponding path program 602 times [2020-02-10 19:46:41,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558787668] [2020-02-10 19:46:41,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,737 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:46:41,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558787668] [2020-02-10 19:46:41,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:41,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002136240] [2020-02-10 19:46:41,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:41,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:41,738 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-02-10 19:46:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,820 INFO L93 Difference]: Finished difference Result 151 states and 314 transitions. [2020-02-10 19:46:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:41,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,821 INFO L225 Difference]: With dead ends: 151 [2020-02-10 19:46:41,821 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 19:46:41,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 19:46:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 19:46:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 227 transitions. [2020-02-10 19:46:41,824 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 227 transitions. Word has length 19 [2020-02-10 19:46:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,824 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 227 transitions. [2020-02-10 19:46:41,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 227 transitions. [2020-02-10 19:46:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:41,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:41,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:41,825 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1978402594, now seen corresponding path program 603 times [2020-02-10 19:46:41,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707596908] [2020-02-10 19:46:41,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,017 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:46:42,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707596908] [2020-02-10 19:46:42,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:42,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865820500] [2020-02-10 19:46:42,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:42,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:42,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:42,018 INFO L87 Difference]: Start difference. First operand 89 states and 227 transitions. Second operand 8 states. [2020-02-10 19:46:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,099 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 19:46:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:42,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,100 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:46:42,100 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 19:46:42,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 19:46:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-02-10 19:46:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:46:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-02-10 19:46:42,103 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-02-10 19:46:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,103 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-02-10 19:46:42,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-02-10 19:46:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:42,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:42,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:42,103 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -858272764, now seen corresponding path program 604 times [2020-02-10 19:46:42,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194643988] [2020-02-10 19:46:42,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,300 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:46:42,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194643988] [2020-02-10 19:46:42,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:42,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744882238] [2020-02-10 19:46:42,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:42,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:42,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:42,302 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-02-10 19:46:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,364 INFO L93 Difference]: Finished difference Result 151 states and 313 transitions. [2020-02-10 19:46:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:42,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,365 INFO L225 Difference]: With dead ends: 151 [2020-02-10 19:46:42,365 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 19:46:42,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 19:46:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 19:46:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 226 transitions. [2020-02-10 19:46:42,368 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 226 transitions. Word has length 19 [2020-02-10 19:46:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,368 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 226 transitions. [2020-02-10 19:46:42,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 226 transitions. [2020-02-10 19:46:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:42,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:42,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:42,369 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash -80774848, now seen corresponding path program 605 times [2020-02-10 19:46:42,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296478677] [2020-02-10 19:46:42,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,567 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:46:42,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296478677] [2020-02-10 19:46:42,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:42,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323827901] [2020-02-10 19:46:42,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:42,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:42,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:42,568 INFO L87 Difference]: Start difference. First operand 89 states and 226 transitions. Second operand 8 states. [2020-02-10 19:46:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,645 INFO L93 Difference]: Finished difference Result 146 states and 302 transitions. [2020-02-10 19:46:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:42,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,646 INFO L225 Difference]: With dead ends: 146 [2020-02-10 19:46:42,646 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 19:46:42,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 19:46:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2020-02-10 19:46:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-02-10 19:46:42,648 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-02-10 19:46:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,648 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-02-10 19:46:42,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-02-10 19:46:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:42,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:42,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:42,649 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -320417186, now seen corresponding path program 606 times [2020-02-10 19:46:42,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942845322] [2020-02-10 19:46:42,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,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:46:42,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942845322] [2020-02-10 19:46:42,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:42,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755920132] [2020-02-10 19:46:42,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:42,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:42,858 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-02-10 19:46:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,920 INFO L93 Difference]: Finished difference Result 146 states and 301 transitions. [2020-02-10 19:46:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:42,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,921 INFO L225 Difference]: With dead ends: 146 [2020-02-10 19:46:42,921 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:46:42,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:46:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-02-10 19:46:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 224 transitions. [2020-02-10 19:46:42,924 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 224 transitions. Word has length 19 [2020-02-10 19:46:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,924 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 224 transitions. [2020-02-10 19:46:42,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 224 transitions. [2020-02-10 19:46:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:42,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:42,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:42,924 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -455398370, now seen corresponding path program 607 times [2020-02-10 19:46:42,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565543095] [2020-02-10 19:46:42,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,096 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:46:43,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565543095] [2020-02-10 19:46:43,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:43,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173536174] [2020-02-10 19:46:43,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:43,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:43,097 INFO L87 Difference]: Start difference. First operand 88 states and 224 transitions. Second operand 8 states. [2020-02-10 19:46:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,177 INFO L93 Difference]: Finished difference Result 161 states and 343 transitions. [2020-02-10 19:46:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:43,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,178 INFO L225 Difference]: With dead ends: 161 [2020-02-10 19:46:43,178 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 19:46:43,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 19:46:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-02-10 19:46:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-02-10 19:46:43,181 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-02-10 19:46:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,181 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-02-10 19:46:43,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-02-10 19:46:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:43,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:43,182 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1329733696, now seen corresponding path program 608 times [2020-02-10 19:46:43,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407780653] [2020-02-10 19:46:43,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,357 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:46:43,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407780653] [2020-02-10 19:46:43,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:43,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410171592] [2020-02-10 19:46:43,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:43,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:43,358 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-02-10 19:46:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,438 INFO L93 Difference]: Finished difference Result 157 states and 332 transitions. [2020-02-10 19:46:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:43,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,439 INFO L225 Difference]: With dead ends: 157 [2020-02-10 19:46:43,439 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:43,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 19:46:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-02-10 19:46:43,445 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-02-10 19:46:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,445 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-02-10 19:46:43,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-02-10 19:46:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:43,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:43,445 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1034006626, now seen corresponding path program 609 times [2020-02-10 19:46:43,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049143486] [2020-02-10 19:46:43,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,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:46:43,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049143486] [2020-02-10 19:46:43,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:43,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594738615] [2020-02-10 19:46:43,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:43,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:43,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:43,621 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-02-10 19:46:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,700 INFO L93 Difference]: Finished difference Result 165 states and 353 transitions. [2020-02-10 19:46:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:43,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,701 INFO L225 Difference]: With dead ends: 165 [2020-02-10 19:46:43,701 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 19:46:43,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 19:46:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-02-10 19:46:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 19:46:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-02-10 19:46:43,704 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-02-10 19:46:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,704 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-02-10 19:46:43,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-02-10 19:46:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:43,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:43,705 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash 288709482, now seen corresponding path program 610 times [2020-02-10 19:46:43,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089443185] [2020-02-10 19:46:43,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,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:46:43,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089443185] [2020-02-10 19:46:43,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:43,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005785089] [2020-02-10 19:46:43,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:43,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:43,880 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-02-10 19:46:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,962 INFO L93 Difference]: Finished difference Result 163 states and 345 transitions. [2020-02-10 19:46:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:43,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,963 INFO L225 Difference]: With dead ends: 163 [2020-02-10 19:46:43,964 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 19:46:43,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 19:46:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-02-10 19:46:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-02-10 19:46:43,966 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-02-10 19:46:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,966 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-02-10 19:46:43,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-02-10 19:46:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:43,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:43,967 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1901188502, now seen corresponding path program 611 times [2020-02-10 19:46:43,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754485643] [2020-02-10 19:46:43,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,150 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:46:44,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754485643] [2020-02-10 19:46:44,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:44,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290871252] [2020-02-10 19:46:44,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:44,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:44,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:44,152 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-02-10 19:46:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,232 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-02-10 19:46:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:44,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,233 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:46:44,233 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:44,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-02-10 19:46:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 230 transitions. [2020-02-10 19:46:44,235 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 230 transitions. Word has length 19 [2020-02-10 19:46:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,236 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 230 transitions. [2020-02-10 19:46:44,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 230 transitions. [2020-02-10 19:46:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:44,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:44,236 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,237 INFO L82 PathProgramCache]: Analyzing trace with hash -190575194, now seen corresponding path program 612 times [2020-02-10 19:46:44,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610022095] [2020-02-10 19:46:44,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,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:46:44,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610022095] [2020-02-10 19:46:44,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:44,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730511379] [2020-02-10 19:46:44,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:44,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:44,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:44,418 INFO L87 Difference]: Start difference. First operand 92 states and 230 transitions. Second operand 8 states. [2020-02-10 19:46:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,498 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-02-10 19:46:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:44,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,499 INFO L225 Difference]: With dead ends: 157 [2020-02-10 19:46:44,500 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 19:46:44,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 19:46:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-02-10 19:46:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 223 transitions. [2020-02-10 19:46:44,502 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 223 transitions. Word has length 19 [2020-02-10 19:46:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,502 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 223 transitions. [2020-02-10 19:46:44,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 223 transitions. [2020-02-10 19:46:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:44,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:44,503 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,503 INFO L82 PathProgramCache]: Analyzing trace with hash -884311006, now seen corresponding path program 613 times [2020-02-10 19:46:44,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097177002] [2020-02-10 19:46:44,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,675 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:46:44,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097177002] [2020-02-10 19:46:44,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:44,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369862133] [2020-02-10 19:46:44,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:44,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:44,676 INFO L87 Difference]: Start difference. First operand 88 states and 223 transitions. Second operand 8 states. [2020-02-10 19:46:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,749 INFO L93 Difference]: Finished difference Result 161 states and 342 transitions. [2020-02-10 19:46:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:44,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,749 INFO L225 Difference]: With dead ends: 161 [2020-02-10 19:46:44,749 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 19:46:44,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 19:46:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-02-10 19:46:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-02-10 19:46:44,752 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-02-10 19:46:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,752 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-02-10 19:46:44,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-02-10 19:46:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:44,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:44,753 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 235818824, now seen corresponding path program 614 times [2020-02-10 19:46:44,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763569463] [2020-02-10 19:46:44,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,929 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:46:44,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763569463] [2020-02-10 19:46:44,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:44,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779814427] [2020-02-10 19:46:44,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:44,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:44,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:44,931 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-02-10 19:46:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,989 INFO L93 Difference]: Finished difference Result 157 states and 331 transitions. [2020-02-10 19:46:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:44,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,990 INFO L225 Difference]: With dead ends: 157 [2020-02-10 19:46:44,990 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:44,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 19:46:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 228 transitions. [2020-02-10 19:46:44,993 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 228 transitions. Word has length 19 [2020-02-10 19:46:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,993 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 228 transitions. [2020-02-10 19:46:44,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 228 transitions. [2020-02-10 19:46:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:44,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:44,994 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1629013504, now seen corresponding path program 615 times [2020-02-10 19:46:44,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091336668] [2020-02-10 19:46:44,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,177 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:46:45,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091336668] [2020-02-10 19:46:45,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:45,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32580868] [2020-02-10 19:46:45,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:45,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:45,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:45,179 INFO L87 Difference]: Start difference. First operand 90 states and 228 transitions. Second operand 8 states. [2020-02-10 19:46:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,252 INFO L93 Difference]: Finished difference Result 165 states and 352 transitions. [2020-02-10 19:46:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:45,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,253 INFO L225 Difference]: With dead ends: 165 [2020-02-10 19:46:45,253 INFO L226 Difference]: Without dead ends: 151 [2020-02-10 19:46:45,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-02-10 19:46:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-02-10 19:46:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 19:46:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-02-10 19:46:45,256 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-02-10 19:46:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,256 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-02-10 19:46:45,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-02-10 19:46:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:45,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,257 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:45,257 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1920656648, now seen corresponding path program 616 times [2020-02-10 19:46:45,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992481413] [2020-02-10 19:46:45,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,429 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:46:45,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992481413] [2020-02-10 19:46:45,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:45,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774644322] [2020-02-10 19:46:45,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:45,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:45,431 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-02-10 19:46:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,510 INFO L93 Difference]: Finished difference Result 163 states and 344 transitions. [2020-02-10 19:46:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:45,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,511 INFO L225 Difference]: With dead ends: 163 [2020-02-10 19:46:45,511 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 19:46:45,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 19:46:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-02-10 19:46:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 19:46:45,514 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 19:46:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,514 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 19:46:45,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 19:46:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:45,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:45,514 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,515 INFO L82 PathProgramCache]: Analyzing trace with hash -299410978, now seen corresponding path program 617 times [2020-02-10 19:46:45,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301601777] [2020-02-10 19:46:45,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,704 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:46:45,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301601777] [2020-02-10 19:46:45,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:45,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931847257] [2020-02-10 19:46:45,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:45,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:45,706 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 19:46:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,766 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-02-10 19:46:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:45,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,767 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:46:45,767 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:45,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-02-10 19:46:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 19:46:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 229 transitions. [2020-02-10 19:46:45,770 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 229 transitions. Word has length 19 [2020-02-10 19:46:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,770 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 229 transitions. [2020-02-10 19:46:45,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 229 transitions. [2020-02-10 19:46:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:45,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:45,771 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1154717632, now seen corresponding path program 618 times [2020-02-10 19:46:45,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275926001] [2020-02-10 19:46:45,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,956 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:46:45,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275926001] [2020-02-10 19:46:45,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:45,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864068496] [2020-02-10 19:46:45,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:45,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:45,957 INFO L87 Difference]: Start difference. First operand 92 states and 229 transitions. Second operand 8 states. [2020-02-10 19:46:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,039 INFO L93 Difference]: Finished difference Result 157 states and 328 transitions. [2020-02-10 19:46:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:46,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,040 INFO L225 Difference]: With dead ends: 157 [2020-02-10 19:46:46,040 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 19:46:46,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 19:46:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-02-10 19:46:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 222 transitions. [2020-02-10 19:46:46,043 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 222 transitions. Word has length 19 [2020-02-10 19:46:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,043 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 222 transitions. [2020-02-10 19:46:46,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 222 transitions. [2020-02-10 19:46:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:46,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,044 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 506970474, now seen corresponding path program 619 times [2020-02-10 19:46:46,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88413308] [2020-02-10 19:46:46,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,246 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:46:46,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88413308] [2020-02-10 19:46:46,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:46,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541691054] [2020-02-10 19:46:46,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:46,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:46,248 INFO L87 Difference]: Start difference. First operand 88 states and 222 transitions. Second operand 8 states. [2020-02-10 19:46:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,317 INFO L93 Difference]: Finished difference Result 144 states and 297 transitions. [2020-02-10 19:46:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:46,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,318 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:46:46,318 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:46:46,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:46:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2020-02-10 19:46:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 19:46:46,320 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 19:46:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,321 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 19:46:46,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 19:46:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:46,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,321 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash 267328136, now seen corresponding path program 620 times [2020-02-10 19:46:46,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451703553] [2020-02-10 19:46:46,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,523 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:46:46,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451703553] [2020-02-10 19:46:46,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:46,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525042200] [2020-02-10 19:46:46,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:46,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:46,525 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 19:46:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,584 INFO L93 Difference]: Finished difference Result 144 states and 296 transitions. [2020-02-10 19:46:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:46,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,585 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:46:46,586 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 19:46:46,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 19:46:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2020-02-10 19:46:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 224 transitions. [2020-02-10 19:46:46,588 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 224 transitions. Word has length 19 [2020-02-10 19:46:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,588 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 224 transitions. [2020-02-10 19:46:46,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 224 transitions. [2020-02-10 19:46:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:46,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,589 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,589 INFO L82 PathProgramCache]: Analyzing trace with hash -237732024, now seen corresponding path program 621 times [2020-02-10 19:46:46,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836494545] [2020-02-10 19:46:46,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,785 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:46:46,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836494545] [2020-02-10 19:46:46,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:46,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750296605] [2020-02-10 19:46:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:46,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:46,786 INFO L87 Difference]: Start difference. First operand 89 states and 224 transitions. Second operand 8 states. [2020-02-10 19:46:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,862 INFO L93 Difference]: Finished difference Result 147 states and 304 transitions. [2020-02-10 19:46:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:46,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,863 INFO L225 Difference]: With dead ends: 147 [2020-02-10 19:46:46,863 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 19:46:46,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 19:46:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 19:46:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:46:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 227 transitions. [2020-02-10 19:46:46,866 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 227 transitions. Word has length 19 [2020-02-10 19:46:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,866 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 227 transitions. [2020-02-10 19:46:46,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 227 transitions. [2020-02-10 19:46:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:46,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,867 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1472881284, now seen corresponding path program 622 times [2020-02-10 19:46:46,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987462233] [2020-02-10 19:46:46,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,064 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:46:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987462233] [2020-02-10 19:46:47,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:47,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397613224] [2020-02-10 19:46:47,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:47,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:47,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:47,065 INFO L87 Difference]: Start difference. First operand 91 states and 227 transitions. Second operand 8 states. [2020-02-10 19:46:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,143 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-02-10 19:46:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:47,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,144 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:46:47,144 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 19:46:47,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 19:46:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2020-02-10 19:46:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-02-10 19:46:47,147 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-02-10 19:46:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,147 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-02-10 19:46:47,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-02-10 19:46:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:47,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:47,148 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,148 INFO L82 PathProgramCache]: Analyzing trace with hash -805757244, now seen corresponding path program 623 times [2020-02-10 19:46:47,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570484579] [2020-02-10 19:46:47,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:47,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570484579] [2020-02-10 19:46:47,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:47,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519256341] [2020-02-10 19:46:47,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:47,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:47,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:47,352 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-02-10 19:46:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,414 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-02-10 19:46:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:47,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,415 INFO L225 Difference]: With dead ends: 147 [2020-02-10 19:46:47,415 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 19:46:47,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 19:46:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 19:46:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 19:46:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 226 transitions. [2020-02-10 19:46:47,418 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 226 transitions. Word has length 19 [2020-02-10 19:46:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,418 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 226 transitions. [2020-02-10 19:46:47,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 226 transitions. [2020-02-10 19:46:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:47,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:47,419 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1661063898, now seen corresponding path program 624 times [2020-02-10 19:46:47,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905996186] [2020-02-10 19:46:47,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,618 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:46:47,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905996186] [2020-02-10 19:46:47,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:47,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032633229] [2020-02-10 19:46:47,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:47,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:47,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:47,619 INFO L87 Difference]: Start difference. First operand 91 states and 226 transitions. Second operand 8 states. [2020-02-10 19:46:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,695 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-02-10 19:46:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:47,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,696 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:46:47,696 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 19:46:47,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 19:46:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2020-02-10 19:46:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 220 transitions. [2020-02-10 19:46:47,699 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 220 transitions. Word has length 19 [2020-02-10 19:46:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,699 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 220 transitions. [2020-02-10 19:46:47,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 220 transitions. [2020-02-10 19:46:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:47,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:47,700 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 625 times [2020-02-10 19:46:47,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647804915] [2020-02-10 19:46:47,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,893 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:46:47,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647804915] [2020-02-10 19:46:47,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:47,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482834080] [2020-02-10 19:46:47,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:47,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:47,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:47,894 INFO L87 Difference]: Start difference. First operand 87 states and 220 transitions. Second operand 8 states. [2020-02-10 19:46:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,974 INFO L93 Difference]: Finished difference Result 153 states and 317 transitions. [2020-02-10 19:46:47,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:47,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,975 INFO L225 Difference]: With dead ends: 153 [2020-02-10 19:46:47,975 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 19:46:47,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 19:46:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 19:46:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-02-10 19:46:47,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-02-10 19:46:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,978 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-02-10 19:46:47,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-02-10 19:46:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:47,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:47,979 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 626 times [2020-02-10 19:46:47,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029920170] [2020-02-10 19:46:47,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,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:46:48,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029920170] [2020-02-10 19:46:48,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:48,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105187267] [2020-02-10 19:46:48,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:48,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:48,158 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-02-10 19:46:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,238 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-02-10 19:46:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:48,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,239 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:46:48,239 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 19:46:48,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 19:46:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-02-10 19:46:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 219 transitions. [2020-02-10 19:46:48,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 219 transitions. Word has length 19 [2020-02-10 19:46:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,241 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 219 transitions. [2020-02-10 19:46:48,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 219 transitions. [2020-02-10 19:46:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:48,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:48,242 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:48,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 627 times [2020-02-10 19:46:48,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558868056] [2020-02-10 19:46:48,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,424 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:46:48,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558868056] [2020-02-10 19:46:48,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:48,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291600508] [2020-02-10 19:46:48,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:48,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:48,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:48,425 INFO L87 Difference]: Start difference. First operand 87 states and 219 transitions. Second operand 8 states. [2020-02-10 19:46:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,498 INFO L93 Difference]: Finished difference Result 153 states and 316 transitions. [2020-02-10 19:46:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:48,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,499 INFO L225 Difference]: With dead ends: 153 [2020-02-10 19:46:48,499 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 19:46:48,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 19:46:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-02-10 19:46:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 222 transitions. [2020-02-10 19:46:48,502 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 222 transitions. Word has length 19 [2020-02-10 19:46:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,502 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 222 transitions. [2020-02-10 19:46:48,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 222 transitions. [2020-02-10 19:46:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:48,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:48,503 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1067761314, now seen corresponding path program 628 times [2020-02-10 19:46:48,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254570690] [2020-02-10 19:46:48,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,687 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:46:48,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254570690] [2020-02-10 19:46:48,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:48,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234060491] [2020-02-10 19:46:48,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:48,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:48,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:48,688 INFO L87 Difference]: Start difference. First operand 89 states and 222 transitions. Second operand 8 states. [2020-02-10 19:46:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,750 INFO L93 Difference]: Finished difference Result 149 states and 305 transitions. [2020-02-10 19:46:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:48,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,751 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:46:48,751 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 19:46:48,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 19:46:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-02-10 19:46:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 218 transitions. [2020-02-10 19:46:48,754 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 218 transitions. Word has length 19 [2020-02-10 19:46:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,754 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 218 transitions. [2020-02-10 19:46:48,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 218 transitions. [2020-02-10 19:46:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:48,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:48,754 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 629 times [2020-02-10 19:46:48,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348922806] [2020-02-10 19:46:48,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:48,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348922806] [2020-02-10 19:46:48,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:48,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125475468] [2020-02-10 19:46:48,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:48,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:48,948 INFO L87 Difference]: Start difference. First operand 87 states and 218 transitions. Second operand 8 states. [2020-02-10 19:46:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,027 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-02-10 19:46:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:49,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,028 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:46:49,028 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:46:49,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:46:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-02-10 19:46:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-02-10 19:46:49,034 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-02-10 19:46:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,034 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-02-10 19:46:49,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-02-10 19:46:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:49,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:49,035 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 630 times [2020-02-10 19:46:49,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704104363] [2020-02-10 19:46:49,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,232 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:46:49,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704104363] [2020-02-10 19:46:49,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:49,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703862753] [2020-02-10 19:46:49,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:49,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:49,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:49,234 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-02-10 19:46:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,293 INFO L93 Difference]: Finished difference Result 144 states and 293 transitions. [2020-02-10 19:46:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:49,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,293 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:46:49,293 INFO L226 Difference]: Without dead ends: 132 [2020-02-10 19:46:49,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-02-10 19:46:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 86. [2020-02-10 19:46:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 19:46:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 216 transitions. [2020-02-10 19:46:49,296 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 216 transitions. Word has length 19 [2020-02-10 19:46:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,296 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 216 transitions. [2020-02-10 19:46:49,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 216 transitions. [2020-02-10 19:46:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:49,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:49,297 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,297 INFO L82 PathProgramCache]: Analyzing trace with hash -119299042, now seen corresponding path program 631 times [2020-02-10 19:46:49,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843954317] [2020-02-10 19:46:49,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,474 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:46:49,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843954317] [2020-02-10 19:46:49,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:49,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969424668] [2020-02-10 19:46:49,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:49,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:49,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:49,475 INFO L87 Difference]: Start difference. First operand 86 states and 216 transitions. Second operand 8 states. [2020-02-10 19:46:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,554 INFO L93 Difference]: Finished difference Result 159 states and 335 transitions. [2020-02-10 19:46:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:49,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,555 INFO L225 Difference]: With dead ends: 159 [2020-02-10 19:46:49,555 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:49,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 19:46:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-02-10 19:46:49,558 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-02-10 19:46:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,558 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-02-10 19:46:49,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-02-10 19:46:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:49,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:49,559 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash -993634368, now seen corresponding path program 632 times [2020-02-10 19:46:49,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815376875] [2020-02-10 19:46:49,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,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:46:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815376875] [2020-02-10 19:46:49,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:49,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002430250] [2020-02-10 19:46:49,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:49,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:49,734 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-02-10 19:46:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,807 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 19:46:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:49,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,808 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:46:49,808 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 19:46:49,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 19:46:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-02-10 19:46:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 221 transitions. [2020-02-10 19:46:49,811 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 221 transitions. Word has length 19 [2020-02-10 19:46:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,811 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 221 transitions. [2020-02-10 19:46:49,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 221 transitions. [2020-02-10 19:46:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:49,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:49,812 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,812 INFO L82 PathProgramCache]: Analyzing trace with hash -579720990, now seen corresponding path program 633 times [2020-02-10 19:46:49,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818195178] [2020-02-10 19:46:49,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,990 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:46:49,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818195178] [2020-02-10 19:46:49,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:49,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143323441] [2020-02-10 19:46:49,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:49,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:49,991 INFO L87 Difference]: Start difference. First operand 88 states and 221 transitions. Second operand 8 states. [2020-02-10 19:46:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,072 INFO L93 Difference]: Finished difference Result 159 states and 338 transitions. [2020-02-10 19:46:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:50,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,073 INFO L225 Difference]: With dead ends: 159 [2020-02-10 19:46:50,073 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:50,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 19:46:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 231 transitions. [2020-02-10 19:46:50,076 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 231 transitions. Word has length 19 [2020-02-10 19:46:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,076 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 231 transitions. [2020-02-10 19:46:50,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 231 transitions. [2020-02-10 19:46:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:50,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:50,077 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash 389163050, now seen corresponding path program 634 times [2020-02-10 19:46:50,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524732309] [2020-02-10 19:46:50,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,257 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:46:50,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524732309] [2020-02-10 19:46:50,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:50,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2188155] [2020-02-10 19:46:50,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:50,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:50,258 INFO L87 Difference]: Start difference. First operand 93 states and 231 transitions. Second operand 8 states. [2020-02-10 19:46:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,339 INFO L93 Difference]: Finished difference Result 149 states and 322 transitions. [2020-02-10 19:46:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:50,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,340 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:46:50,340 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 19:46:50,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 19:46:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-02-10 19:46:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-02-10 19:46:50,342 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-02-10 19:46:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,342 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-02-10 19:46:50,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-02-10 19:46:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:50,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:50,343 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 780051178, now seen corresponding path program 635 times [2020-02-10 19:46:50,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845319194] [2020-02-10 19:46:50,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:50,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845319194] [2020-02-10 19:46:50,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:50,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421052078] [2020-02-10 19:46:50,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:50,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:50,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:50,529 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-02-10 19:46:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,609 INFO L93 Difference]: Finished difference Result 152 states and 317 transitions. [2020-02-10 19:46:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:50,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,610 INFO L225 Difference]: With dead ends: 152 [2020-02-10 19:46:50,610 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 19:46:50,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 19:46:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-02-10 19:46:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 222 transitions. [2020-02-10 19:46:50,612 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 222 transitions. Word has length 19 [2020-02-10 19:46:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,612 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 222 transitions. [2020-02-10 19:46:50,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 222 transitions. [2020-02-10 19:46:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:50,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:50,613 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash -948996156, now seen corresponding path program 636 times [2020-02-10 19:46:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258043118] [2020-02-10 19:46:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,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:46:50,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258043118] [2020-02-10 19:46:50,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:50,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448715188] [2020-02-10 19:46:50,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:50,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:50,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:50,793 INFO L87 Difference]: Start difference. First operand 90 states and 222 transitions. Second operand 8 states. [2020-02-10 19:46:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,882 INFO L93 Difference]: Finished difference Result 146 states and 313 transitions. [2020-02-10 19:46:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:50,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,883 INFO L225 Difference]: With dead ends: 146 [2020-02-10 19:46:50,883 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 19:46:50,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 19:46:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-02-10 19:46:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 19:46:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 215 transitions. [2020-02-10 19:46:50,886 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 215 transitions. Word has length 19 [2020-02-10 19:46:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,886 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 215 transitions. [2020-02-10 19:46:50,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 215 transitions. [2020-02-10 19:46:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:50,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:50,887 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,887 INFO L82 PathProgramCache]: Analyzing trace with hash -558714782, now seen corresponding path program 637 times [2020-02-10 19:46:50,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405325471] [2020-02-10 19:46:50,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,069 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:46:51,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405325471] [2020-02-10 19:46:51,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:51,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473356853] [2020-02-10 19:46:51,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:51,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:51,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:51,071 INFO L87 Difference]: Start difference. First operand 86 states and 215 transitions. Second operand 8 states. [2020-02-10 19:46:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,148 INFO L93 Difference]: Finished difference Result 159 states and 334 transitions. [2020-02-10 19:46:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:51,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,149 INFO L225 Difference]: With dead ends: 159 [2020-02-10 19:46:51,149 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:51,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-02-10 19:46:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 225 transitions. [2020-02-10 19:46:51,152 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 225 transitions. Word has length 19 [2020-02-10 19:46:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,152 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 225 transitions. [2020-02-10 19:46:51,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 225 transitions. [2020-02-10 19:46:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:51,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:51,153 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 561415048, now seen corresponding path program 638 times [2020-02-10 19:46:51,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076166295] [2020-02-10 19:46:51,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,340 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:46:51,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076166295] [2020-02-10 19:46:51,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:51,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58717668] [2020-02-10 19:46:51,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:51,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:51,341 INFO L87 Difference]: Start difference. First operand 90 states and 225 transitions. Second operand 8 states. [2020-02-10 19:46:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,397 INFO L93 Difference]: Finished difference Result 155 states and 323 transitions. [2020-02-10 19:46:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:51,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,398 INFO L225 Difference]: With dead ends: 155 [2020-02-10 19:46:51,398 INFO L226 Difference]: Without dead ends: 143 [2020-02-10 19:46:51,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-02-10 19:46:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-02-10 19:46:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 220 transitions. [2020-02-10 19:46:51,400 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 220 transitions. Word has length 19 [2020-02-10 19:46:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,400 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 220 transitions. [2020-02-10 19:46:51,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 220 transitions. [2020-02-10 19:46:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:51,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:51,400 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1631800162, now seen corresponding path program 639 times [2020-02-10 19:46:51,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908651757] [2020-02-10 19:46:51,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,590 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:46:51,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908651757] [2020-02-10 19:46:51,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:51,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18796914] [2020-02-10 19:46:51,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:51,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:51,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:51,592 INFO L87 Difference]: Start difference. First operand 88 states and 220 transitions. Second operand 8 states. [2020-02-10 19:46:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,670 INFO L93 Difference]: Finished difference Result 159 states and 337 transitions. [2020-02-10 19:46:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:51,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,671 INFO L225 Difference]: With dead ends: 159 [2020-02-10 19:46:51,671 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 19:46:51,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 19:46:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-02-10 19:46:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 19:46:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 230 transitions. [2020-02-10 19:46:51,674 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 230 transitions. Word has length 19 [2020-02-10 19:46:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,674 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 230 transitions. [2020-02-10 19:46:51,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 230 transitions. [2020-02-10 19:46:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:51,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:51,675 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2021110216, now seen corresponding path program 640 times [2020-02-10 19:46:51,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160127137] [2020-02-10 19:46:51,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,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:46:51,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160127137] [2020-02-10 19:46:51,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:51,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162318657] [2020-02-10 19:46:51,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:51,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:51,863 INFO L87 Difference]: Start difference. First operand 93 states and 230 transitions. Second operand 8 states. [2020-02-10 19:46:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,947 INFO L93 Difference]: Finished difference Result 149 states and 321 transitions. [2020-02-10 19:46:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:51,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,948 INFO L225 Difference]: With dead ends: 149 [2020-02-10 19:46:51,948 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 19:46:51,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 19:46:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-02-10 19:46:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-02-10 19:46:51,950 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-02-10 19:46:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,950 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-02-10 19:46:51,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-02-10 19:46:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:51,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:51,951 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1637126204, now seen corresponding path program 641 times [2020-02-10 19:46:51,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708649855] [2020-02-10 19:46:51,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,143 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:46:52,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708649855] [2020-02-10 19:46:52,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:52,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089454899] [2020-02-10 19:46:52,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:52,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:52,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:52,145 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-02-10 19:46:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,206 INFO L93 Difference]: Finished difference Result 152 states and 316 transitions. [2020-02-10 19:46:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:52,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,207 INFO L225 Difference]: With dead ends: 152 [2020-02-10 19:46:52,207 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 19:46:52,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 19:46:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-02-10 19:46:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 19:46:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 221 transitions. [2020-02-10 19:46:52,210 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 221 transitions. Word has length 19 [2020-02-10 19:46:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,210 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 221 transitions. [2020-02-10 19:46:52,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 221 transitions. [2020-02-10 19:46:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:52,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,210 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:52,210 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1168436096, now seen corresponding path program 642 times [2020-02-10 19:46:52,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324091594] [2020-02-10 19:46:52,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,390 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:46:52,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324091594] [2020-02-10 19:46:52,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:52,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577296230] [2020-02-10 19:46:52,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:52,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:52,392 INFO L87 Difference]: Start difference. First operand 90 states and 221 transitions. Second operand 8 states. [2020-02-10 19:46:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,472 INFO L93 Difference]: Finished difference Result 146 states and 312 transitions. [2020-02-10 19:46:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:52,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,473 INFO L225 Difference]: With dead ends: 146 [2020-02-10 19:46:52,473 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 19:46:52,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 19:46:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-02-10 19:46:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 19:46:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 214 transitions. [2020-02-10 19:46:52,476 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 214 transitions. Word has length 19 [2020-02-10 19:46:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,476 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 214 transitions. [2020-02-10 19:46:52,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 214 transitions. [2020-02-10 19:46:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:52,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:52,477 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 832566698, now seen corresponding path program 643 times [2020-02-10 19:46:52,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822737029] [2020-02-10 19:46:52,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,675 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:46:52,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822737029] [2020-02-10 19:46:52,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:52,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572457334] [2020-02-10 19:46:52,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:52,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:52,676 INFO L87 Difference]: Start difference. First operand 86 states and 214 transitions. Second operand 8 states. [2020-02-10 19:46:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,752 INFO L93 Difference]: Finished difference Result 142 states and 289 transitions. [2020-02-10 19:46:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:52,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,753 INFO L225 Difference]: With dead ends: 142 [2020-02-10 19:46:52,753 INFO L226 Difference]: Without dead ends: 132 [2020-02-10 19:46:52,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-02-10 19:46:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2020-02-10 19:46:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-02-10 19:46:52,755 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-02-10 19:46:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,756 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-02-10 19:46:52,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-02-10 19:46:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:52,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:52,756 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 592924360, now seen corresponding path program 644 times [2020-02-10 19:46:52,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162483310] [2020-02-10 19:46:52,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:52,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162483310] [2020-02-10 19:46:52,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:52,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132426832] [2020-02-10 19:46:52,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:52,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:52,956 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-02-10 19:46:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,005 INFO L93 Difference]: Finished difference Result 142 states and 288 transitions. [2020-02-10 19:46:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:53,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,006 INFO L225 Difference]: With dead ends: 142 [2020-02-10 19:46:53,006 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 19:46:53,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 19:46:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 87. [2020-02-10 19:46:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 216 transitions. [2020-02-10 19:46:53,009 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 216 transitions. Word has length 19 [2020-02-10 19:46:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,009 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 216 transitions. [2020-02-10 19:46:53,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 216 transitions. [2020-02-10 19:46:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:53,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,009 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:53,010 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash -240518682, now seen corresponding path program 645 times [2020-02-10 19:46:53,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615507462] [2020-02-10 19:46:53,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,198 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:46:53,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615507462] [2020-02-10 19:46:53,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:53,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898508224] [2020-02-10 19:46:53,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:53,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:53,199 INFO L87 Difference]: Start difference. First operand 87 states and 216 transitions. Second operand 8 states. [2020-02-10 19:46:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,265 INFO L93 Difference]: Finished difference Result 144 states and 295 transitions. [2020-02-10 19:46:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:53,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,266 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:46:53,266 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:46:53,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:46:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-02-10 19:46:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 219 transitions. [2020-02-10 19:46:53,269 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 219 transitions. Word has length 19 [2020-02-10 19:46:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,269 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 219 transitions. [2020-02-10 19:46:53,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 219 transitions. [2020-02-10 19:46:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:53,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:53,270 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash 714460322, now seen corresponding path program 646 times [2020-02-10 19:46:53,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971195897] [2020-02-10 19:46:53,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,454 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:46:53,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971195897] [2020-02-10 19:46:53,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:53,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989904087] [2020-02-10 19:46:53,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:53,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:53,456 INFO L87 Difference]: Start difference. First operand 89 states and 219 transitions. Second operand 8 states. [2020-02-10 19:46:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,529 INFO L93 Difference]: Finished difference Result 138 states and 291 transitions. [2020-02-10 19:46:53,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:53,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,530 INFO L225 Difference]: With dead ends: 138 [2020-02-10 19:46:53,530 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 19:46:53,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 19:46:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-02-10 19:46:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-02-10 19:46:53,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-02-10 19:46:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,532 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-02-10 19:46:53,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-02-10 19:46:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:53,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:53,533 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1130779938, now seen corresponding path program 647 times [2020-02-10 19:46:53,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485403835] [2020-02-10 19:46:53,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,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:46:53,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485403835] [2020-02-10 19:46:53,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:53,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375302697] [2020-02-10 19:46:53,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:53,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:53,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:53,734 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-02-10 19:46:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,781 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-02-10 19:46:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:53,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,782 INFO L225 Difference]: With dead ends: 144 [2020-02-10 19:46:53,782 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:46:53,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:46:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-02-10 19:46:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-02-10 19:46:53,785 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-02-10 19:46:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,785 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-02-10 19:46:53,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-02-10 19:46:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:53,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:53,786 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:53,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1674782362, now seen corresponding path program 648 times [2020-02-10 19:46:53,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106917305] [2020-02-10 19:46:53,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,971 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:46:53,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106917305] [2020-02-10 19:46:53,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:53,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509329081] [2020-02-10 19:46:53,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:53,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:53,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:53,972 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-02-10 19:46:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,041 INFO L93 Difference]: Finished difference Result 138 states and 290 transitions. [2020-02-10 19:46:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:54,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,042 INFO L225 Difference]: With dead ends: 138 [2020-02-10 19:46:54,042 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 19:46:54,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 19:46:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-02-10 19:46:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:46:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 212 transitions. [2020-02-10 19:46:54,044 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 212 transitions. Word has length 19 [2020-02-10 19:46:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,045 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 212 transitions. [2020-02-10 19:46:54,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 212 transitions. [2020-02-10 19:46:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:54,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:54,045 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -898297510, now seen corresponding path program 649 times [2020-02-10 19:46:54,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639963589] [2020-02-10 19:46:54,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,218 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:46:54,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639963589] [2020-02-10 19:46:54,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:54,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759844756] [2020-02-10 19:46:54,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:54,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:54,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:54,219 INFO L87 Difference]: Start difference. First operand 85 states and 212 transitions. Second operand 8 states. [2020-02-10 19:46:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,286 INFO L93 Difference]: Finished difference Result 154 states and 319 transitions. [2020-02-10 19:46:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:54,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,287 INFO L225 Difference]: With dead ends: 154 [2020-02-10 19:46:54,288 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 19:46:54,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 19:46:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 87. [2020-02-10 19:46:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-02-10 19:46:54,290 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-02-10 19:46:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,290 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-02-10 19:46:54,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-02-10 19:46:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:54,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:54,291 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1772632836, now seen corresponding path program 650 times [2020-02-10 19:46:54,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163326536] [2020-02-10 19:46:54,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,464 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:46:54,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163326536] [2020-02-10 19:46:54,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:54,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600427318] [2020-02-10 19:46:54,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:54,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:54,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:54,465 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-02-10 19:46:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,533 INFO L93 Difference]: Finished difference Result 150 states and 308 transitions. [2020-02-10 19:46:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:54,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,534 INFO L225 Difference]: With dead ends: 150 [2020-02-10 19:46:54,534 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 19:46:54,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 19:46:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-02-10 19:46:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:46:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 210 transitions. [2020-02-10 19:46:54,537 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 210 transitions. Word has length 19 [2020-02-10 19:46:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,537 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 210 transitions. [2020-02-10 19:46:54,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 210 transitions. [2020-02-10 19:46:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:54,537 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:54,537 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,537 INFO L82 PathProgramCache]: Analyzing trace with hash 591107486, now seen corresponding path program 651 times [2020-02-10 19:46:54,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224181824] [2020-02-10 19:46:54,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,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:46:54,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224181824] [2020-02-10 19:46:54,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:54,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903909059] [2020-02-10 19:46:54,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:54,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:54,710 INFO L87 Difference]: Start difference. First operand 85 states and 210 transitions. Second operand 8 states. [2020-02-10 19:46:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,774 INFO L93 Difference]: Finished difference Result 158 states and 329 transitions. [2020-02-10 19:46:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:54,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,775 INFO L225 Difference]: With dead ends: 158 [2020-02-10 19:46:54,775 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 19:46:54,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 19:46:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 89. [2020-02-10 19:46:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 19:46:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-02-10 19:46:54,778 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-02-10 19:46:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,778 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-02-10 19:46:54,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-02-10 19:46:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:54,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:54,778 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -154189658, now seen corresponding path program 652 times [2020-02-10 19:46:54,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352549847] [2020-02-10 19:46:54,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:54,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352549847] [2020-02-10 19:46:54,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:54,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564430425] [2020-02-10 19:46:54,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:54,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:54,955 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-02-10 19:46:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,023 INFO L93 Difference]: Finished difference Result 156 states and 321 transitions. [2020-02-10 19:46:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:55,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,024 INFO L225 Difference]: With dead ends: 156 [2020-02-10 19:46:55,024 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 19:46:55,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 19:46:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 85. [2020-02-10 19:46:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:46:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 208 transitions. [2020-02-10 19:46:55,026 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 208 transitions. Word has length 19 [2020-02-10 19:46:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,026 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 208 transitions. [2020-02-10 19:46:55,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 208 transitions. [2020-02-10 19:46:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:55,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,027 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:55,027 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1950879654, now seen corresponding path program 653 times [2020-02-10 19:46:55,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584456800] [2020-02-10 19:46:55,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,207 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:46:55,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584456800] [2020-02-10 19:46:55,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:55,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770789732] [2020-02-10 19:46:55,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:55,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:55,208 INFO L87 Difference]: Start difference. First operand 85 states and 208 transitions. Second operand 8 states. [2020-02-10 19:46:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,273 INFO L93 Difference]: Finished difference Result 148 states and 302 transitions. [2020-02-10 19:46:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:55,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,273 INFO L225 Difference]: With dead ends: 148 [2020-02-10 19:46:55,274 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 19:46:55,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 19:46:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2020-02-10 19:46:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 211 transitions. [2020-02-10 19:46:55,276 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 211 transitions. Word has length 19 [2020-02-10 19:46:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,277 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 211 transitions. [2020-02-10 19:46:55,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 211 transitions. [2020-02-10 19:46:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:55,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:55,277 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:55,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash -633474334, now seen corresponding path program 654 times [2020-02-10 19:46:55,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976247817] [2020-02-10 19:46:55,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,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:46:55,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976247817] [2020-02-10 19:46:55,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:55,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525018165] [2020-02-10 19:46:55,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:55,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:55,461 INFO L87 Difference]: Start difference. First operand 87 states and 211 transitions. Second operand 8 states. [2020-02-10 19:46:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,528 INFO L93 Difference]: Finished difference Result 150 states and 305 transitions. [2020-02-10 19:46:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:55,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,528 INFO L225 Difference]: With dead ends: 150 [2020-02-10 19:46:55,529 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 19:46:55,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 19:46:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2020-02-10 19:46:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:46:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 203 transitions. [2020-02-10 19:46:55,531 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 203 transitions. Word has length 19 [2020-02-10 19:46:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,531 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 203 transitions. [2020-02-10 19:46:55,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 203 transitions. [2020-02-10 19:46:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:55,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:55,532 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 655 times [2020-02-10 19:46:55,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720667512] [2020-02-10 19:46:55,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,705 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:46:55,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720667512] [2020-02-10 19:46:55,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:55,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590685308] [2020-02-10 19:46:55,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:55,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:55,706 INFO L87 Difference]: Start difference. First operand 83 states and 203 transitions. Second operand 8 states. [2020-02-10 19:46:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,772 INFO L93 Difference]: Finished difference Result 152 states and 310 transitions. [2020-02-10 19:46:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:55,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,773 INFO L225 Difference]: With dead ends: 152 [2020-02-10 19:46:55,774 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 19:46:55,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 19:46:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-02-10 19:46:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:46:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-02-10 19:46:55,776 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-02-10 19:46:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,776 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-02-10 19:46:55,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-02-10 19:46:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:55,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:55,777 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 656 times [2020-02-10 19:46:55,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123274423] [2020-02-10 19:46:55,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,946 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:46:55,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123274423] [2020-02-10 19:46:55,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:55,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579246929] [2020-02-10 19:46:55,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:55,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:55,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:55,947 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-02-10 19:46:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,012 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-02-10 19:46:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:56,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,013 INFO L225 Difference]: With dead ends: 148 [2020-02-10 19:46:56,013 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 19:46:56,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 19:46:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2020-02-10 19:46:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:46:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 196 transitions. [2020-02-10 19:46:56,016 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 196 transitions. Word has length 19 [2020-02-10 19:46:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,016 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 196 transitions. [2020-02-10 19:46:56,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 196 transitions. [2020-02-10 19:46:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:56,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:56,017 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1020716864, now seen corresponding path program 657 times [2020-02-10 19:46:56,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570669879] [2020-02-10 19:46:56,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,198 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:46:56,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570669879] [2020-02-10 19:46:56,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:56,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798150055] [2020-02-10 19:46:56,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:56,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:56,199 INFO L87 Difference]: Start difference. First operand 81 states and 196 transitions. Second operand 8 states. [2020-02-10 19:46:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,266 INFO L93 Difference]: Finished difference Result 152 states and 313 transitions. [2020-02-10 19:46:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:56,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,267 INFO L225 Difference]: With dead ends: 152 [2020-02-10 19:46:56,267 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 19:46:56,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:56,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 19:46:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2020-02-10 19:46:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 19:46:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 206 transitions. [2020-02-10 19:46:56,270 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 206 transitions. Word has length 19 [2020-02-10 19:46:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,270 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 206 transitions. [2020-02-10 19:46:56,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 206 transitions. [2020-02-10 19:46:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:56,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:56,271 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1989600904, now seen corresponding path program 658 times [2020-02-10 19:46:56,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829573288] [2020-02-10 19:46:56,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,447 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:46:56,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829573288] [2020-02-10 19:46:56,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:56,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309061818] [2020-02-10 19:46:56,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:56,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:56,448 INFO L87 Difference]: Start difference. First operand 86 states and 206 transitions. Second operand 8 states. [2020-02-10 19:46:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,516 INFO L93 Difference]: Finished difference Result 142 states and 297 transitions. [2020-02-10 19:46:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:56,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,517 INFO L225 Difference]: With dead ends: 142 [2020-02-10 19:46:56,517 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 19:46:56,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 19:46:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-02-10 19:46:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:46:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 194 transitions. [2020-02-10 19:46:56,519 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 194 transitions. Word has length 19 [2020-02-10 19:46:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,519 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 194 transitions. [2020-02-10 19:46:56,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 194 transitions. [2020-02-10 19:46:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:56,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:56,520 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1914478264, now seen corresponding path program 659 times [2020-02-10 19:46:56,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586974114] [2020-02-10 19:46:56,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,696 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:46:56,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586974114] [2020-02-10 19:46:56,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:56,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560526977] [2020-02-10 19:46:56,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:56,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:56,698 INFO L87 Difference]: Start difference. First operand 81 states and 194 transitions. Second operand 8 states. [2020-02-10 19:46:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,761 INFO L93 Difference]: Finished difference Result 145 states and 292 transitions. [2020-02-10 19:46:56,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:56,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,762 INFO L225 Difference]: With dead ends: 145 [2020-02-10 19:46:56,762 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 19:46:56,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 19:46:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-02-10 19:46:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:46:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 19:46:56,764 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 19:46:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,764 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 19:46:56,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 19:46:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:56,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:56,765 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash 651441698, now seen corresponding path program 660 times [2020-02-10 19:46:56,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556865564] [2020-02-10 19:46:56,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,940 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:46:56,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556865564] [2020-02-10 19:46:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:56,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667612740] [2020-02-10 19:46:56,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:56,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:56,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:56,941 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 19:46:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,008 INFO L93 Difference]: Finished difference Result 139 states and 288 transitions. [2020-02-10 19:46:57,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:57,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,009 INFO L225 Difference]: With dead ends: 139 [2020-02-10 19:46:57,009 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 19:46:57,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 19:46:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-02-10 19:46:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 19:46:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 189 transitions. [2020-02-10 19:46:57,011 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 189 transitions. Word has length 19 [2020-02-10 19:46:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,011 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 189 transitions. [2020-02-10 19:46:57,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 189 transitions. [2020-02-10 19:46:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:57,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:57,012 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash -797071014, now seen corresponding path program 661 times [2020-02-10 19:46:57,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774389207] [2020-02-10 19:46:57,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,194 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:46:57,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774389207] [2020-02-10 19:46:57,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:57,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679125553] [2020-02-10 19:46:57,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:57,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:57,195 INFO L87 Difference]: Start difference. First operand 79 states and 189 transitions. Second operand 8 states. [2020-02-10 19:46:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,264 INFO L93 Difference]: Finished difference Result 156 states and 329 transitions. [2020-02-10 19:46:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:57,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,265 INFO L225 Difference]: With dead ends: 156 [2020-02-10 19:46:57,265 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 19:46:57,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 19:46:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2020-02-10 19:46:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 213 transitions. [2020-02-10 19:46:57,267 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 213 transitions. Word has length 19 [2020-02-10 19:46:57,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,267 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 213 transitions. [2020-02-10 19:46:57,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 213 transitions. [2020-02-10 19:46:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:57,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:57,268 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1542368158, now seen corresponding path program 662 times [2020-02-10 19:46:57,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010677786] [2020-02-10 19:46:57,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,459 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:46:57,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010677786] [2020-02-10 19:46:57,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:57,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421155442] [2020-02-10 19:46:57,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:57,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:57,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:57,460 INFO L87 Difference]: Start difference. First operand 87 states and 213 transitions. Second operand 8 states. [2020-02-10 19:46:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,527 INFO L93 Difference]: Finished difference Result 154 states and 321 transitions. [2020-02-10 19:46:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:57,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,528 INFO L225 Difference]: With dead ends: 154 [2020-02-10 19:46:57,528 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 19:46:57,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 19:46:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-02-10 19:46:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:46:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-02-10 19:46:57,530 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-02-10 19:46:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,531 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-02-10 19:46:57,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-02-10 19:46:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:57,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:57,531 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,531 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 663 times [2020-02-10 19:46:57,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427437153] [2020-02-10 19:46:57,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,717 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:46:57,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427437153] [2020-02-10 19:46:57,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:57,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389886968] [2020-02-10 19:46:57,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:57,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:57,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:57,719 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-02-10 19:46:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,785 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-02-10 19:46:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:57,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,785 INFO L225 Difference]: With dead ends: 147 [2020-02-10 19:46:57,786 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 19:46:57,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 19:46:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2020-02-10 19:46:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 19:46:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-02-10 19:46:57,788 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 19 [2020-02-10 19:46:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,788 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-02-10 19:46:57,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-02-10 19:46:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:57,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:57,789 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:57,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash 916515524, now seen corresponding path program 664 times [2020-02-10 19:46:57,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563229142] [2020-02-10 19:46:57,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,980 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:46:57,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563229142] [2020-02-10 19:46:57,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:57,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921767506] [2020-02-10 19:46:57,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:57,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:57,981 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 8 states. [2020-02-10 19:46:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,051 INFO L93 Difference]: Finished difference Result 137 states and 287 transitions. [2020-02-10 19:46:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:58,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,052 INFO L225 Difference]: With dead ends: 137 [2020-02-10 19:46:58,052 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 19:46:58,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 19:46:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2020-02-10 19:46:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:46:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 19:46:58,054 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 19:46:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,054 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 19:46:58,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 19:46:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:58,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:58,055 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1571733990, now seen corresponding path program 665 times [2020-02-10 19:46:58,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877630297] [2020-02-10 19:46:58,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,244 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:46:58,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877630297] [2020-02-10 19:46:58,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:58,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203171631] [2020-02-10 19:46:58,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:58,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:58,246 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 19:46:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,312 INFO L93 Difference]: Finished difference Result 135 states and 283 transitions. [2020-02-10 19:46:58,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:58,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,313 INFO L225 Difference]: With dead ends: 135 [2020-02-10 19:46:58,314 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 19:46:58,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 19:46:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-02-10 19:46:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 19:46:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-02-10 19:46:58,316 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 19 [2020-02-10 19:46:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,316 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-02-10 19:46:58,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-02-10 19:46:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:58,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,317 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:58,317 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash -712859460, now seen corresponding path program 666 times [2020-02-10 19:46:58,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140294649] [2020-02-10 19:46:58,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,509 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:46:58,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140294649] [2020-02-10 19:46:58,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:58,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082469399] [2020-02-10 19:46:58,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:58,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:58,510 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 8 states. [2020-02-10 19:46:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,573 INFO L93 Difference]: Finished difference Result 122 states and 262 transitions. [2020-02-10 19:46:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:58,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,573 INFO L225 Difference]: With dead ends: 122 [2020-02-10 19:46:58,573 INFO L226 Difference]: Without dead ends: 101 [2020-02-10 19:46:58,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-02-10 19:46:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-02-10 19:46:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 19:46:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 187 transitions. [2020-02-10 19:46:58,575 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 187 transitions. Word has length 19 [2020-02-10 19:46:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,576 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 187 transitions. [2020-02-10 19:46:58,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 187 transitions. [2020-02-10 19:46:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:58,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:58,576 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1100556732, now seen corresponding path program 667 times [2020-02-10 19:46:58,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712962468] [2020-02-10 19:46:58,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,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:46:58,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712962468] [2020-02-10 19:46:58,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:58,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681458176] [2020-02-10 19:46:58,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:58,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:58,769 INFO L87 Difference]: Start difference. First operand 79 states and 187 transitions. Second operand 8 states. [2020-02-10 19:46:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,833 INFO L93 Difference]: Finished difference Result 141 states and 283 transitions. [2020-02-10 19:46:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:58,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,834 INFO L225 Difference]: With dead ends: 141 [2020-02-10 19:46:58,834 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 19:46:58,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 19:46:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2020-02-10 19:46:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:46:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-02-10 19:46:58,836 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-02-10 19:46:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,836 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-02-10 19:46:58,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-02-10 19:46:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:58,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:58,837 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1483797256, now seen corresponding path program 668 times [2020-02-10 19:46:58,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028106175] [2020-02-10 19:46:58,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,025 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:46:59,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028106175] [2020-02-10 19:46:59,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:59,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760391777] [2020-02-10 19:46:59,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:59,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:59,026 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-02-10 19:46:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,093 INFO L93 Difference]: Finished difference Result 143 states and 286 transitions. [2020-02-10 19:46:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:59,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,094 INFO L225 Difference]: With dead ends: 143 [2020-02-10 19:46:59,094 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 19:46:59,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 19:46:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2020-02-10 19:46:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:46:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 192 transitions. [2020-02-10 19:46:59,096 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 192 transitions. Word has length 19 [2020-02-10 19:46:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,096 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 192 transitions. [2020-02-10 19:46:59,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 192 transitions. [2020-02-10 19:46:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:59,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:59,097 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 669 times [2020-02-10 19:46:59,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779323348] [2020-02-10 19:46:59,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,289 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:46:59,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779323348] [2020-02-10 19:46:59,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:59,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652615140] [2020-02-10 19:46:59,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:59,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:59,290 INFO L87 Difference]: Start difference. First operand 81 states and 192 transitions. Second operand 8 states. [2020-02-10 19:46:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,354 INFO L93 Difference]: Finished difference Result 138 states and 275 transitions. [2020-02-10 19:46:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:59,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,355 INFO L225 Difference]: With dead ends: 138 [2020-02-10 19:46:59,355 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 19:46:59,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 19:46:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2020-02-10 19:46:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 19:46:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 195 transitions. [2020-02-10 19:46:59,358 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 195 transitions. Word has length 19 [2020-02-10 19:46:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,358 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 195 transitions. [2020-02-10 19:46:59,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 195 transitions. [2020-02-10 19:46:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:59,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:59,358 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:59,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash 116211896, now seen corresponding path program 670 times [2020-02-10 19:46:59,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836791637] [2020-02-10 19:46:59,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,548 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:46:59,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836791637] [2020-02-10 19:46:59,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:59,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274755745] [2020-02-10 19:46:59,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:59,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:59,549 INFO L87 Difference]: Start difference. First operand 83 states and 195 transitions. Second operand 8 states. [2020-02-10 19:46:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,620 INFO L93 Difference]: Finished difference Result 132 states and 271 transitions. [2020-02-10 19:46:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:59,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,620 INFO L225 Difference]: With dead ends: 132 [2020-02-10 19:46:59,620 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 19:46:59,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 19:46:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2020-02-10 19:46:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:46:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 190 transitions. [2020-02-10 19:46:59,623 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 190 transitions. Word has length 19 [2020-02-10 19:46:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,623 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 190 transitions. [2020-02-10 19:46:59,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 190 transitions. [2020-02-10 19:46:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:59,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:59,623 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash 750310238, now seen corresponding path program 671 times [2020-02-10 19:46:59,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697509497] [2020-02-10 19:46:59,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,813 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:46:59,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697509497] [2020-02-10 19:46:59,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:46:59,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996128742] [2020-02-10 19:46:59,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:46:59,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:46:59,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:46:59,815 INFO L87 Difference]: Start difference. First operand 81 states and 190 transitions. Second operand 8 states. [2020-02-10 19:46:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,888 INFO L93 Difference]: Finished difference Result 133 states and 276 transitions. [2020-02-10 19:46:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:46:59,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:46:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,889 INFO L225 Difference]: With dead ends: 133 [2020-02-10 19:46:59,889 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 19:46:59,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:46:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 19:46:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-02-10 19:46:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 19:46:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 198 transitions. [2020-02-10 19:46:59,892 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 198 transitions. Word has length 19 [2020-02-10 19:46:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,892 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 198 transitions. [2020-02-10 19:46:59,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:46:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 198 transitions. [2020-02-10 19:46:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:46:59,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:59,893 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 672 times [2020-02-10 19:46:59,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652768853] [2020-02-10 19:46:59,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:00,079 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:47:00,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652768853] [2020-02-10 19:47:00,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:00,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783834778] [2020-02-10 19:47:00,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:00,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:00,080 INFO L87 Difference]: Start difference. First operand 85 states and 198 transitions. Second operand 8 states. [2020-02-10 19:47:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,146 INFO L93 Difference]: Finished difference Result 120 states and 255 transitions. [2020-02-10 19:47:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:00,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,147 INFO L225 Difference]: With dead ends: 120 [2020-02-10 19:47:00,147 INFO L226 Difference]: Without dead ends: 99 [2020-02-10 19:47:00,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-02-10 19:47:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2020-02-10 19:47:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 19:47:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 183 transitions. [2020-02-10 19:47:00,150 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 183 transitions. Word has length 19 [2020-02-10 19:47:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,150 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 183 transitions. [2020-02-10 19:47:00,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 183 transitions. [2020-02-10 19:47:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:00,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,151 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash 598823932, now seen corresponding path program 673 times [2020-02-10 19:47:00,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071429580] [2020-02-10 19:47:00,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:00,323 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:47:00,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071429580] [2020-02-10 19:47:00,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:00,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988102169] [2020-02-10 19:47:00,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:00,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:00,325 INFO L87 Difference]: Start difference. First operand 77 states and 183 transitions. Second operand 8 states. [2020-02-10 19:47:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,390 INFO L93 Difference]: Finished difference Result 136 states and 266 transitions. [2020-02-10 19:47:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:00,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,391 INFO L225 Difference]: With dead ends: 136 [2020-02-10 19:47:00,391 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 19:47:00,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 19:47:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-02-10 19:47:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 19:47:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 186 transitions. [2020-02-10 19:47:00,393 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 186 transitions. Word has length 19 [2020-02-10 19:47:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,394 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 186 transitions. [2020-02-10 19:47:00,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 186 transitions. [2020-02-10 19:47:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:00,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,395 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1718953762, now seen corresponding path program 674 times [2020-02-10 19:47:00,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385611780] [2020-02-10 19:47:00,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:00,571 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:47:00,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385611780] [2020-02-10 19:47:00,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:00,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229313815] [2020-02-10 19:47:00,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:00,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:00,573 INFO L87 Difference]: Start difference. First operand 79 states and 186 transitions. Second operand 8 states. [2020-02-10 19:47:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,618 INFO L93 Difference]: Finished difference Result 132 states and 255 transitions. [2020-02-10 19:47:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:00,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,619 INFO L225 Difference]: With dead ends: 132 [2020-02-10 19:47:00,619 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 19:47:00,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 19:47:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2020-02-10 19:47:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 19:47:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 181 transitions. [2020-02-10 19:47:00,622 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 181 transitions. Word has length 19 [2020-02-10 19:47:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,622 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 181 transitions. [2020-02-10 19:47:00,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 181 transitions. [2020-02-10 19:47:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:00,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,622 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash -145878566, now seen corresponding path program 675 times [2020-02-10 19:47:00,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301248290] [2020-02-10 19:47:00,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:00,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301248290] [2020-02-10 19:47:00,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:00,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867010825] [2020-02-10 19:47:00,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:00,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:00,804 INFO L87 Difference]: Start difference. First operand 77 states and 181 transitions. Second operand 8 states. [2020-02-10 19:47:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,867 INFO L93 Difference]: Finished difference Result 140 states and 276 transitions. [2020-02-10 19:47:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:00,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,868 INFO L225 Difference]: With dead ends: 140 [2020-02-10 19:47:00,868 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 19:47:00,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 19:47:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2020-02-10 19:47:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 19:47:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 189 transitions. [2020-02-10 19:47:00,870 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 189 transitions. Word has length 19 [2020-02-10 19:47:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,870 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 189 transitions. [2020-02-10 19:47:00,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 189 transitions. [2020-02-10 19:47:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:00,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,871 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash -891175710, now seen corresponding path program 676 times [2020-02-10 19:47:00,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672671613] [2020-02-10 19:47:00,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,043 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:47:01,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672671613] [2020-02-10 19:47:01,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:01,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985558555] [2020-02-10 19:47:01,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:01,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:01,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:01,045 INFO L87 Difference]: Start difference. First operand 81 states and 189 transitions. Second operand 8 states. [2020-02-10 19:47:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,111 INFO L93 Difference]: Finished difference Result 138 states and 268 transitions. [2020-02-10 19:47:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:01,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,111 INFO L225 Difference]: With dead ends: 138 [2020-02-10 19:47:01,112 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 19:47:01,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 19:47:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2020-02-10 19:47:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 19:47:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 179 transitions. [2020-02-10 19:47:01,114 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 179 transitions. Word has length 19 [2020-02-10 19:47:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,114 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 179 transitions. [2020-02-10 19:47:01,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 179 transitions. [2020-02-10 19:47:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:01,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,115 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1183723960, now seen corresponding path program 677 times [2020-02-10 19:47:01,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315908673] [2020-02-10 19:47:01,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,298 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:47:01,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315908673] [2020-02-10 19:47:01,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:01,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706265333] [2020-02-10 19:47:01,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:01,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:01,299 INFO L87 Difference]: Start difference. First operand 77 states and 179 transitions. Second operand 8 states. [2020-02-10 19:47:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,345 INFO L93 Difference]: Finished difference Result 130 states and 249 transitions. [2020-02-10 19:47:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:01,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,346 INFO L225 Difference]: With dead ends: 130 [2020-02-10 19:47:01,346 INFO L226 Difference]: Without dead ends: 120 [2020-02-10 19:47:01,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-02-10 19:47:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 79. [2020-02-10 19:47:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 19:47:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-02-10 19:47:01,349 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 19 [2020-02-10 19:47:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,349 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-02-10 19:47:01,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-02-10 19:47:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:01,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,350 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash 328417306, now seen corresponding path program 678 times [2020-02-10 19:47:01,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419714660] [2020-02-10 19:47:01,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,530 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:47:01,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419714660] [2020-02-10 19:47:01,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:01,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376830702] [2020-02-10 19:47:01,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:01,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:01,532 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 8 states. [2020-02-10 19:47:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,596 INFO L93 Difference]: Finished difference Result 132 states and 252 transitions. [2020-02-10 19:47:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:01,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,597 INFO L225 Difference]: With dead ends: 132 [2020-02-10 19:47:01,597 INFO L226 Difference]: Without dead ends: 116 [2020-02-10 19:47:01,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-02-10 19:47:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-02-10 19:47:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 19:47:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 174 transitions. [2020-02-10 19:47:01,599 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 174 transitions. Word has length 19 [2020-02-10 19:47:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,600 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 174 transitions. [2020-02-10 19:47:01,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 174 transitions. [2020-02-10 19:47:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:01,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,600 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 679 times [2020-02-10 19:47:01,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632886195] [2020-02-10 19:47:01,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,784 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:47:01,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632886195] [2020-02-10 19:47:01,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:01,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226374929] [2020-02-10 19:47:01,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:01,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:01,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:01,785 INFO L87 Difference]: Start difference. First operand 75 states and 174 transitions. Second operand 8 states. [2020-02-10 19:47:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,854 INFO L93 Difference]: Finished difference Result 133 states and 254 transitions. [2020-02-10 19:47:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:01,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,855 INFO L225 Difference]: With dead ends: 133 [2020-02-10 19:47:01,855 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 19:47:01,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 19:47:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2020-02-10 19:47:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 19:47:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 172 transitions. [2020-02-10 19:47:01,857 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 172 transitions. Word has length 19 [2020-02-10 19:47:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,858 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 172 transitions. [2020-02-10 19:47:01,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 172 transitions. [2020-02-10 19:47:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:01,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,858 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash 118515908, now seen corresponding path program 680 times [2020-02-10 19:47:01,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126634300] [2020-02-10 19:47:01,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,043 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:47:02,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126634300] [2020-02-10 19:47:02,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:02,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934373694] [2020-02-10 19:47:02,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:02,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:02,045 INFO L87 Difference]: Start difference. First operand 75 states and 172 transitions. Second operand 8 states. [2020-02-10 19:47:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,092 INFO L93 Difference]: Finished difference Result 129 states and 243 transitions. [2020-02-10 19:47:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:02,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,093 INFO L225 Difference]: With dead ends: 129 [2020-02-10 19:47:02,093 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 19:47:02,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 19:47:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2020-02-10 19:47:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 19:47:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 167 transitions. [2020-02-10 19:47:02,096 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 167 transitions. Word has length 19 [2020-02-10 19:47:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,096 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 167 transitions. [2020-02-10 19:47:02,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 167 transitions. [2020-02-10 19:47:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:02,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,097 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2074699302, now seen corresponding path program 681 times [2020-02-10 19:47:02,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6287703] [2020-02-10 19:47:02,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,288 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:47:02,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6287703] [2020-02-10 19:47:02,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:02,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526342183] [2020-02-10 19:47:02,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:02,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:02,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:02,290 INFO L87 Difference]: Start difference. First operand 73 states and 167 transitions. Second operand 8 states. [2020-02-10 19:47:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,354 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 19:47:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:02,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,355 INFO L225 Difference]: With dead ends: 133 [2020-02-10 19:47:02,355 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 19:47:02,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 19:47:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 78. [2020-02-10 19:47:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 19:47:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-02-10 19:47:02,357 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 19 [2020-02-10 19:47:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,357 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-02-10 19:47:02,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-02-10 19:47:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:02,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,358 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:02,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1578211076, now seen corresponding path program 682 times [2020-02-10 19:47:02,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811253362] [2020-02-10 19:47:02,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,544 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:47:02,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811253362] [2020-02-10 19:47:02,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:02,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902495785] [2020-02-10 19:47:02,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:02,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:02,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:02,546 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 8 states. [2020-02-10 19:47:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,614 INFO L93 Difference]: Finished difference Result 123 states and 241 transitions. [2020-02-10 19:47:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:02,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,615 INFO L225 Difference]: With dead ends: 123 [2020-02-10 19:47:02,615 INFO L226 Difference]: Without dead ends: 105 [2020-02-10 19:47:02,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-02-10 19:47:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2020-02-10 19:47:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 19:47:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2020-02-10 19:47:02,617 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 165 transitions. Word has length 19 [2020-02-10 19:47:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,617 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 165 transitions. [2020-02-10 19:47:02,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 165 transitions. [2020-02-10 19:47:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:02,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,618 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1194227064, now seen corresponding path program 683 times [2020-02-10 19:47:02,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903308403] [2020-02-10 19:47:02,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,821 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:47:02,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903308403] [2020-02-10 19:47:02,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:02,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915736773] [2020-02-10 19:47:02,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:02,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:02,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:02,822 INFO L87 Difference]: Start difference. First operand 73 states and 165 transitions. Second operand 8 states. [2020-02-10 19:47:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,868 INFO L93 Difference]: Finished difference Result 126 states and 236 transitions. [2020-02-10 19:47:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:02,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,868 INFO L225 Difference]: With dead ends: 126 [2020-02-10 19:47:02,869 INFO L226 Difference]: Without dead ends: 116 [2020-02-10 19:47:02,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:02,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-02-10 19:47:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-02-10 19:47:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 19:47:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-02-10 19:47:02,871 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 19 [2020-02-10 19:47:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,871 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-02-10 19:47:02,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-02-10 19:47:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:02,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,872 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1611335236, now seen corresponding path program 684 times [2020-02-10 19:47:02,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381257297] [2020-02-10 19:47:02,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,059 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:47:03,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381257297] [2020-02-10 19:47:03,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:03,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880957244] [2020-02-10 19:47:03,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:03,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:03,060 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 8 states. [2020-02-10 19:47:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,125 INFO L93 Difference]: Finished difference Result 120 states and 232 transitions. [2020-02-10 19:47:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:03,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,126 INFO L225 Difference]: With dead ends: 120 [2020-02-10 19:47:03,126 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 19:47:03,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 19:47:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2020-02-10 19:47:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 19:47:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 160 transitions. [2020-02-10 19:47:03,128 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 160 transitions. Word has length 19 [2020-02-10 19:47:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,128 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 160 transitions. [2020-02-10 19:47:03,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 160 transitions. [2020-02-10 19:47:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:03,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:03,129 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 948213022, now seen corresponding path program 685 times [2020-02-10 19:47:03,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474713258] [2020-02-10 19:47:03,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,315 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:47:03,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474713258] [2020-02-10 19:47:03,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:03,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923475161] [2020-02-10 19:47:03,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:03,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:03,316 INFO L87 Difference]: Start difference. First operand 71 states and 160 transitions. Second operand 8 states. [2020-02-10 19:47:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,380 INFO L93 Difference]: Finished difference Result 129 states and 245 transitions. [2020-02-10 19:47:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:03,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,381 INFO L225 Difference]: With dead ends: 129 [2020-02-10 19:47:03,382 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 19:47:03,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 19:47:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2020-02-10 19:47:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 19:47:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 156 transitions. [2020-02-10 19:47:03,385 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 156 transitions. Word has length 19 [2020-02-10 19:47:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,385 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 156 transitions. [2020-02-10 19:47:03,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 156 transitions. [2020-02-10 19:47:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:03,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:03,386 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash 202915878, now seen corresponding path program 686 times [2020-02-10 19:47:03,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381635712] [2020-02-10 19:47:03,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,572 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:47:03,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381635712] [2020-02-10 19:47:03,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:03,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619889719] [2020-02-10 19:47:03,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:03,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:03,574 INFO L87 Difference]: Start difference. First operand 71 states and 156 transitions. Second operand 8 states. [2020-02-10 19:47:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,640 INFO L93 Difference]: Finished difference Result 127 states and 237 transitions. [2020-02-10 19:47:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:03,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,640 INFO L225 Difference]: With dead ends: 127 [2020-02-10 19:47:03,641 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 19:47:03,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 19:47:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2020-02-10 19:47:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-02-10 19:47:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 144 transitions. [2020-02-10 19:47:03,643 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 144 transitions. Word has length 19 [2020-02-10 19:47:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,643 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 144 transitions. [2020-02-10 19:47:03,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 144 transitions. [2020-02-10 19:47:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:03,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:03,644 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 687 times [2020-02-10 19:47:03,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958530674] [2020-02-10 19:47:03,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,834 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:47:03,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958530674] [2020-02-10 19:47:03,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:03,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858714749] [2020-02-10 19:47:03,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:03,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:03,836 INFO L87 Difference]: Start difference. First operand 67 states and 144 transitions. Second operand 8 states. [2020-02-10 19:47:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,903 INFO L93 Difference]: Finished difference Result 120 states and 219 transitions. [2020-02-10 19:47:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:03,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,903 INFO L225 Difference]: With dead ends: 120 [2020-02-10 19:47:03,904 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 19:47:03,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 19:47:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2020-02-10 19:47:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-02-10 19:47:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-02-10 19:47:03,906 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 19 [2020-02-10 19:47:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,906 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-02-10 19:47:03,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-02-10 19:47:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:03,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:03,907 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -32729882, now seen corresponding path program 688 times [2020-02-10 19:47:03,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139902135] [2020-02-10 19:47:03,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,100 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:47:04,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139902135] [2020-02-10 19:47:04,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:04,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911094445] [2020-02-10 19:47:04,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:04,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:04,101 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 8 states. [2020-02-10 19:47:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,167 INFO L93 Difference]: Finished difference Result 110 states and 203 transitions. [2020-02-10 19:47:04,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:04,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,168 INFO L225 Difference]: With dead ends: 110 [2020-02-10 19:47:04,168 INFO L226 Difference]: Without dead ends: 92 [2020-02-10 19:47:04,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-02-10 19:47:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2020-02-10 19:47:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 19:47:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-02-10 19:47:04,170 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-02-10 19:47:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,170 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-02-10 19:47:04,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-02-10 19:47:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:04,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:04,171 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1773987900, now seen corresponding path program 689 times [2020-02-10 19:47:04,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289648179] [2020-02-10 19:47:04,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,364 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:47:04,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289648179] [2020-02-10 19:47:04,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:04,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922966662] [2020-02-10 19:47:04,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:04,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:04,366 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-02-10 19:47:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,430 INFO L93 Difference]: Finished difference Result 108 states and 199 transitions. [2020-02-10 19:47:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:04,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,431 INFO L225 Difference]: With dead ends: 108 [2020-02-10 19:47:04,431 INFO L226 Difference]: Without dead ends: 96 [2020-02-10 19:47:04,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-02-10 19:47:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2020-02-10 19:47:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-02-10 19:47:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 121 transitions. [2020-02-10 19:47:04,433 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 121 transitions. Word has length 19 [2020-02-10 19:47:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,433 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 121 transitions. [2020-02-10 19:47:04,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 121 transitions. [2020-02-10 19:47:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:04,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:04,434 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1662104866, now seen corresponding path program 690 times [2020-02-10 19:47:04,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877182669] [2020-02-10 19:47:04,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,626 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:47:04,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877182669] [2020-02-10 19:47:04,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:04,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270985932] [2020-02-10 19:47:04,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:04,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:04,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:04,628 INFO L87 Difference]: Start difference. First operand 60 states and 121 transitions. Second operand 8 states. [2020-02-10 19:47:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,692 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-02-10 19:47:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:04,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,693 INFO L225 Difference]: With dead ends: 95 [2020-02-10 19:47:04,693 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 19:47:04,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 19:47:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-02-10 19:47:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 19:47:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 103 transitions. [2020-02-10 19:47:04,695 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 103 transitions. Word has length 19 [2020-02-10 19:47:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,696 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 103 transitions. [2020-02-10 19:47:04,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 103 transitions. [2020-02-10 19:47:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:04,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:04,696 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash 171031428, now seen corresponding path program 691 times [2020-02-10 19:47:04,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706878161] [2020-02-10 19:47:04,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,897 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:47:04,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706878161] [2020-02-10 19:47:04,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:04,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098913286] [2020-02-10 19:47:04,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:04,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:04,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:04,899 INFO L87 Difference]: Start difference. First operand 52 states and 103 transitions. Second operand 8 states. [2020-02-10 19:47:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,947 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2020-02-10 19:47:04,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:04,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,948 INFO L225 Difference]: With dead ends: 101 [2020-02-10 19:47:04,948 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 19:47:04,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 19:47:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2020-02-10 19:47:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 19:47:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-02-10 19:47:04,950 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-02-10 19:47:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,950 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-02-10 19:47:04,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-02-10 19:47:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:04,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:04,951 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash -684275226, now seen corresponding path program 692 times [2020-02-10 19:47:04,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415944722] [2020-02-10 19:47:04,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,141 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:47:05,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415944722] [2020-02-10 19:47:05,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:05,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294804333] [2020-02-10 19:47:05,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:05,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:05,142 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-02-10 19:47:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,208 INFO L93 Difference]: Finished difference Result 103 states and 185 transitions. [2020-02-10 19:47:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:05,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,209 INFO L225 Difference]: With dead ends: 103 [2020-02-10 19:47:05,209 INFO L226 Difference]: Without dead ends: 89 [2020-02-10 19:47:05,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-02-10 19:47:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 54. [2020-02-10 19:47:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-02-10 19:47:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 108 transitions. [2020-02-10 19:47:05,211 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 108 transitions. Word has length 19 [2020-02-10 19:47:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,211 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 108 transitions. [2020-02-10 19:47:05,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 108 transitions. [2020-02-10 19:47:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:05,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:05,212 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 693 times [2020-02-10 19:47:05,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304652104] [2020-02-10 19:47:05,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,403 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:47:05,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304652104] [2020-02-10 19:47:05,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:05,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399655227] [2020-02-10 19:47:05,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:05,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:05,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:05,405 INFO L87 Difference]: Start difference. First operand 54 states and 108 transitions. Second operand 8 states. [2020-02-10 19:47:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,450 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-02-10 19:47:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:05,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,451 INFO L225 Difference]: With dead ends: 97 [2020-02-10 19:47:05,451 INFO L226 Difference]: Without dead ends: 87 [2020-02-10 19:47:05,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-02-10 19:47:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2020-02-10 19:47:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-02-10 19:47:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 111 transitions. [2020-02-10 19:47:05,453 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 111 transitions. Word has length 19 [2020-02-10 19:47:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,453 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 111 transitions. [2020-02-10 19:47:05,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 111 transitions. [2020-02-10 19:47:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:05,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:05,454 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1023589914, now seen corresponding path program 694 times [2020-02-10 19:47:05,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161617933] [2020-02-10 19:47:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,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:47:05,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161617933] [2020-02-10 19:47:05,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:05,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83131782] [2020-02-10 19:47:05,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:05,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:05,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:05,642 INFO L87 Difference]: Start difference. First operand 56 states and 111 transitions. Second operand 8 states. [2020-02-10 19:47:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,707 INFO L93 Difference]: Finished difference Result 91 states and 168 transitions. [2020-02-10 19:47:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:05,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,708 INFO L225 Difference]: With dead ends: 91 [2020-02-10 19:47:05,708 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 19:47:05,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 19:47:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2020-02-10 19:47:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-02-10 19:47:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 106 transitions. [2020-02-10 19:47:05,710 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 106 transitions. Word has length 19 [2020-02-10 19:47:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,710 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 106 transitions. [2020-02-10 19:47:05,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 106 transitions. [2020-02-10 19:47:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:05,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:05,711 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1757360606, now seen corresponding path program 695 times [2020-02-10 19:47:05,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016863088] [2020-02-10 19:47:05,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,902 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:47:05,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016863088] [2020-02-10 19:47:05,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:05,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791810739] [2020-02-10 19:47:05,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:05,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:05,904 INFO L87 Difference]: Start difference. First operand 54 states and 106 transitions. Second operand 8 states. [2020-02-10 19:47:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,966 INFO L93 Difference]: Finished difference Result 84 states and 153 transitions. [2020-02-10 19:47:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:05,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,967 INFO L225 Difference]: With dead ends: 84 [2020-02-10 19:47:05,967 INFO L226 Difference]: Without dead ends: 72 [2020-02-10 19:47:05,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-02-10 19:47:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2020-02-10 19:47:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-02-10 19:47:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 114 transitions. [2020-02-10 19:47:05,969 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 114 transitions. Word has length 19 [2020-02-10 19:47:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,969 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 114 transitions. [2020-02-10 19:47:05,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 114 transitions. [2020-02-10 19:47:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:05,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:05,970 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 696 times [2020-02-10 19:47:05,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303166927] [2020-02-10 19:47:05,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:06,163 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:47:06,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303166927] [2020-02-10 19:47:06,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:06,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:06,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224389431] [2020-02-10 19:47:06,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:06,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:06,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:06,164 INFO L87 Difference]: Start difference. First operand 58 states and 114 transitions. Second operand 8 states. [2020-02-10 19:47:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,225 INFO L93 Difference]: Finished difference Result 71 states and 132 transitions. [2020-02-10 19:47:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:06,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,226 INFO L225 Difference]: With dead ends: 71 [2020-02-10 19:47:06,226 INFO L226 Difference]: Without dead ends: 50 [2020-02-10 19:47:06,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-02-10 19:47:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-02-10 19:47:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:47:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 99 transitions. [2020-02-10 19:47:06,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 99 transitions. Word has length 19 [2020-02-10 19:47:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,228 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 99 transitions. [2020-02-10 19:47:06,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 99 transitions. [2020-02-10 19:47:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:06,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:06,229 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash -821726946, now seen corresponding path program 697 times [2020-02-10 19:47:06,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488233632] [2020-02-10 19:47:06,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:06,459 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:47:06,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488233632] [2020-02-10 19:47:06,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:06,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:06,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961681560] [2020-02-10 19:47:06,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:06,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:06,461 INFO L87 Difference]: Start difference. First operand 50 states and 99 transitions. Second operand 8 states. [2020-02-10 19:47:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,525 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-02-10 19:47:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:06,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,525 INFO L225 Difference]: With dead ends: 83 [2020-02-10 19:47:06,526 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 19:47:06,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 19:47:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2020-02-10 19:47:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-02-10 19:47:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2020-02-10 19:47:06,527 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 100 transitions. Word has length 19 [2020-02-10 19:47:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,528 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 100 transitions. [2020-02-10 19:47:06,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 100 transitions. [2020-02-10 19:47:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:06,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:06,528 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1061369284, now seen corresponding path program 698 times [2020-02-10 19:47:06,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818064875] [2020-02-10 19:47:06,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:06,741 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:47:06,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818064875] [2020-02-10 19:47:06,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:06,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:06,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917907319] [2020-02-10 19:47:06,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:06,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:06,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:06,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:06,743 INFO L87 Difference]: Start difference. First operand 51 states and 100 transitions. Second operand 8 states. [2020-02-10 19:47:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,792 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-02-10 19:47:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:06,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,793 INFO L225 Difference]: With dead ends: 83 [2020-02-10 19:47:06,793 INFO L226 Difference]: Without dead ends: 72 [2020-02-10 19:47:06,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-02-10 19:47:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-02-10 19:47:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:47:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2020-02-10 19:47:06,794 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 19 [2020-02-10 19:47:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,795 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2020-02-10 19:47:06,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2020-02-10 19:47:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:06,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:06,795 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1566429444, now seen corresponding path program 699 times [2020-02-10 19:47:06,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798082610] [2020-02-10 19:47:06,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,001 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:47:07,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798082610] [2020-02-10 19:47:07,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:07,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588695265] [2020-02-10 19:47:07,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:07,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:07,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:07,002 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand 8 states. [2020-02-10 19:47:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,065 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2020-02-10 19:47:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:07,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,066 INFO L225 Difference]: With dead ends: 86 [2020-02-10 19:47:07,066 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 19:47:07,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 19:47:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-02-10 19:47:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 19:47:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 101 transitions. [2020-02-10 19:47:07,067 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 101 transitions. Word has length 19 [2020-02-10 19:47:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,067 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 101 transitions. [2020-02-10 19:47:07,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 101 transitions. [2020-02-10 19:47:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:07,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,068 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash 144183864, now seen corresponding path program 700 times [2020-02-10 19:47:07,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982332532] [2020-02-10 19:47:07,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,277 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:47:07,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982332532] [2020-02-10 19:47:07,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:07,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489673532] [2020-02-10 19:47:07,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:07,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:07,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:07,278 INFO L87 Difference]: Start difference. First operand 52 states and 101 transitions. Second operand 8 states. [2020-02-10 19:47:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,343 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2020-02-10 19:47:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:07,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,344 INFO L225 Difference]: With dead ends: 88 [2020-02-10 19:47:07,344 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 19:47:07,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 19:47:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-02-10 19:47:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:47:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2020-02-10 19:47:07,346 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 97 transitions. Word has length 19 [2020-02-10 19:47:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,346 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 97 transitions. [2020-02-10 19:47:07,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 97 transitions. [2020-02-10 19:47:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:07,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,347 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2134454664, now seen corresponding path program 701 times [2020-02-10 19:47:07,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799196434] [2020-02-10 19:47:07,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,556 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:47:07,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799196434] [2020-02-10 19:47:07,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:07,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215084421] [2020-02-10 19:47:07,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:07,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:07,557 INFO L87 Difference]: Start difference. First operand 50 states and 97 transitions. Second operand 8 states. [2020-02-10 19:47:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,598 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2020-02-10 19:47:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:07,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,599 INFO L225 Difference]: With dead ends: 86 [2020-02-10 19:47:07,599 INFO L226 Difference]: Without dead ends: 76 [2020-02-10 19:47:07,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-02-10 19:47:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-02-10 19:47:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-02-10 19:47:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2020-02-10 19:47:07,601 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 100 transitions. Word has length 19 [2020-02-10 19:47:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,601 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 100 transitions. [2020-02-10 19:47:07,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 100 transitions. [2020-02-10 19:47:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:07,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,601 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1305205978, now seen corresponding path program 702 times [2020-02-10 19:47:07,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916741067] [2020-02-10 19:47:07,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,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:47:07,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916741067] [2020-02-10 19:47:07,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:07,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195807651] [2020-02-10 19:47:07,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:07,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:07,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:07,812 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. Second operand 8 states. [2020-02-10 19:47:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,874 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2020-02-10 19:47:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:07,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,875 INFO L225 Difference]: With dead ends: 88 [2020-02-10 19:47:07,875 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 19:47:07,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 19:47:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2020-02-10 19:47:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 19:47:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 95 transitions. [2020-02-10 19:47:07,877 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 95 transitions. Word has length 19 [2020-02-10 19:47:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,877 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 95 transitions. [2020-02-10 19:47:07,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 95 transitions. [2020-02-10 19:47:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:07,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,878 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 703 times [2020-02-10 19:47:07,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814065444] [2020-02-10 19:47:07,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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:47:08,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814065444] [2020-02-10 19:47:08,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:08,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744233756] [2020-02-10 19:47:08,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:08,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:08,090 INFO L87 Difference]: Start difference. First operand 49 states and 95 transitions. Second operand 8 states. [2020-02-10 19:47:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,152 INFO L93 Difference]: Finished difference Result 81 states and 130 transitions. [2020-02-10 19:47:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:08,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,153 INFO L225 Difference]: With dead ends: 81 [2020-02-10 19:47:08,153 INFO L226 Difference]: Without dead ends: 71 [2020-02-10 19:47:08,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-02-10 19:47:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2020-02-10 19:47:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 19:47:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. [2020-02-10 19:47:08,155 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 94 transitions. Word has length 19 [2020-02-10 19:47:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,155 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 94 transitions. [2020-02-10 19:47:08,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 94 transitions. [2020-02-10 19:47:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:08,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:08,155 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 704 times [2020-02-10 19:47:08,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167149198] [2020-02-10 19:47:08,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,368 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:47:08,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167149198] [2020-02-10 19:47:08,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:08,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773213703] [2020-02-10 19:47:08,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:08,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:08,370 INFO L87 Difference]: Start difference. First operand 49 states and 94 transitions. Second operand 8 states. [2020-02-10 19:47:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,414 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-02-10 19:47:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:08,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,415 INFO L225 Difference]: With dead ends: 81 [2020-02-10 19:47:08,415 INFO L226 Difference]: Without dead ends: 70 [2020-02-10 19:47:08,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-02-10 19:47:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2020-02-10 19:47:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 19:47:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2020-02-10 19:47:08,417 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 19 [2020-02-10 19:47:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,417 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2020-02-10 19:47:08,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2020-02-10 19:47:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:08,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:08,418 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash 799717116, now seen corresponding path program 705 times [2020-02-10 19:47:08,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196583410] [2020-02-10 19:47:08,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,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:47:08,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196583410] [2020-02-10 19:47:08,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:08,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200245580] [2020-02-10 19:47:08,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:08,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:08,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:08,620 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand 8 states. [2020-02-10 19:47:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,682 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-02-10 19:47:08,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:08,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,683 INFO L225 Difference]: With dead ends: 83 [2020-02-10 19:47:08,683 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 19:47:08,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 19:47:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-02-10 19:47:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:47:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2020-02-10 19:47:08,684 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 95 transitions. Word has length 19 [2020-02-10 19:47:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,684 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 95 transitions. [2020-02-10 19:47:08,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 95 transitions. [2020-02-10 19:47:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:08,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:08,685 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1754696120, now seen corresponding path program 706 times [2020-02-10 19:47:08,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144885199] [2020-02-10 19:47:08,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,880 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:47:08,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144885199] [2020-02-10 19:47:08,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:08,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326830312] [2020-02-10 19:47:08,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:08,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:08,882 INFO L87 Difference]: Start difference. First operand 50 states and 95 transitions. Second operand 8 states. [2020-02-10 19:47:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,945 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-02-10 19:47:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:08,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,946 INFO L225 Difference]: With dead ends: 77 [2020-02-10 19:47:08,946 INFO L226 Difference]: Without dead ends: 62 [2020-02-10 19:47:08,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-02-10 19:47:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2020-02-10 19:47:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 19:47:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2020-02-10 19:47:08,948 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 91 transitions. Word has length 19 [2020-02-10 19:47:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,948 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 91 transitions. [2020-02-10 19:47:08,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 91 transitions. [2020-02-10 19:47:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:08,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:08,949 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:08,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2123951560, now seen corresponding path program 707 times [2020-02-10 19:47:08,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756033253] [2020-02-10 19:47:08,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,149 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:47:09,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756033253] [2020-02-10 19:47:09,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:09,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608528791] [2020-02-10 19:47:09,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:09,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:09,153 INFO L87 Difference]: Start difference. First operand 48 states and 91 transitions. Second operand 8 states. [2020-02-10 19:47:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,193 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-02-10 19:47:09,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:09,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,194 INFO L225 Difference]: With dead ends: 83 [2020-02-10 19:47:09,194 INFO L226 Difference]: Without dead ends: 73 [2020-02-10 19:47:09,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-02-10 19:47:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-02-10 19:47:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:47:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2020-02-10 19:47:09,195 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 19 [2020-02-10 19:47:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,196 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 94 transitions. [2020-02-10 19:47:09,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 94 transitions. [2020-02-10 19:47:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:09,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:09,196 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash -634546564, now seen corresponding path program 708 times [2020-02-10 19:47:09,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128997666] [2020-02-10 19:47:09,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:09,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128997666] [2020-02-10 19:47:09,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:09,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637194576] [2020-02-10 19:47:09,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:09,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:09,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:09,399 INFO L87 Difference]: Start difference. First operand 50 states and 94 transitions. Second operand 8 states. [2020-02-10 19:47:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,455 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2020-02-10 19:47:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:09,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,456 INFO L225 Difference]: With dead ends: 77 [2020-02-10 19:47:09,456 INFO L226 Difference]: Without dead ends: 61 [2020-02-10 19:47:09,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-02-10 19:47:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2020-02-10 19:47:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-02-10 19:47:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 89 transitions. [2020-02-10 19:47:09,458 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 89 transitions. Word has length 19 [2020-02-10 19:47:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,458 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 89 transitions. [2020-02-10 19:47:09,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 89 transitions. [2020-02-10 19:47:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:09,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:09,459 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash -472337856, now seen corresponding path program 709 times [2020-02-10 19:47:09,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293711183] [2020-02-10 19:47:09,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,664 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:47:09,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293711183] [2020-02-10 19:47:09,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:09,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140809921] [2020-02-10 19:47:09,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:09,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:09,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:09,666 INFO L87 Difference]: Start difference. First operand 47 states and 89 transitions. Second operand 8 states. [2020-02-10 19:47:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,730 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2020-02-10 19:47:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:09,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,730 INFO L225 Difference]: With dead ends: 79 [2020-02-10 19:47:09,730 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 19:47:09,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 19:47:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2020-02-10 19:47:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-02-10 19:47:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2020-02-10 19:47:09,732 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 19 [2020-02-10 19:47:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,732 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 87 transitions. [2020-02-10 19:47:09,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2020-02-10 19:47:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:09,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:09,733 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1238275452, now seen corresponding path program 710 times [2020-02-10 19:47:09,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402075169] [2020-02-10 19:47:09,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,941 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:47:09,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402075169] [2020-02-10 19:47:09,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:09,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020614534] [2020-02-10 19:47:09,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:09,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:09,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:09,943 INFO L87 Difference]: Start difference. First operand 47 states and 87 transitions. Second operand 8 states. [2020-02-10 19:47:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,004 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-02-10 19:47:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:10,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:10,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,005 INFO L225 Difference]: With dead ends: 81 [2020-02-10 19:47:10,005 INFO L226 Difference]: Without dead ends: 67 [2020-02-10 19:47:10,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-02-10 19:47:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2020-02-10 19:47:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-02-10 19:47:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 82 transitions. [2020-02-10 19:47:10,007 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 82 transitions. Word has length 19 [2020-02-10 19:47:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,007 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 82 transitions. [2020-02-10 19:47:10,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 82 transitions. [2020-02-10 19:47:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:10,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,008 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 711 times [2020-02-10 19:47:10,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463263341] [2020-02-10 19:47:10,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,204 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:47:10,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463263341] [2020-02-10 19:47:10,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:10,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829896348] [2020-02-10 19:47:10,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:10,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:10,206 INFO L87 Difference]: Start difference. First operand 45 states and 82 transitions. Second operand 8 states. [2020-02-10 19:47:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,266 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2020-02-10 19:47:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:10,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,267 INFO L225 Difference]: With dead ends: 76 [2020-02-10 19:47:10,267 INFO L226 Difference]: Without dead ends: 66 [2020-02-10 19:47:10,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:10,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-02-10 19:47:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2020-02-10 19:47:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-02-10 19:47:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 77 transitions. [2020-02-10 19:47:10,269 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 77 transitions. Word has length 19 [2020-02-10 19:47:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,269 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 77 transitions. [2020-02-10 19:47:10,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2020-02-10 19:47:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:10,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,270 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 143755162, now seen corresponding path program 712 times [2020-02-10 19:47:10,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621897870] [2020-02-10 19:47:10,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,465 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:47:10,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621897870] [2020-02-10 19:47:10,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:10,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484761939] [2020-02-10 19:47:10,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:10,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:10,467 INFO L87 Difference]: Start difference. First operand 43 states and 77 transitions. Second operand 8 states. [2020-02-10 19:47:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,528 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2020-02-10 19:47:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:10,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,529 INFO L225 Difference]: With dead ends: 70 [2020-02-10 19:47:10,529 INFO L226 Difference]: Without dead ends: 55 [2020-02-10 19:47:10,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-02-10 19:47:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2020-02-10 19:47:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 19:47:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-02-10 19:47:10,531 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 19 [2020-02-10 19:47:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,531 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-02-10 19:47:10,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. [2020-02-10 19:47:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:10,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,532 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash 777853504, now seen corresponding path program 713 times [2020-02-10 19:47:10,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112156851] [2020-02-10 19:47:10,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,736 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:47:10,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112156851] [2020-02-10 19:47:10,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:10,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653808049] [2020-02-10 19:47:10,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:10,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:10,737 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 8 states. [2020-02-10 19:47:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,797 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2020-02-10 19:47:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:10,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,798 INFO L225 Difference]: With dead ends: 71 [2020-02-10 19:47:10,798 INFO L226 Difference]: Without dead ends: 59 [2020-02-10 19:47:10,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-02-10 19:47:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2020-02-10 19:47:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-02-10 19:47:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2020-02-10 19:47:10,800 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 19 [2020-02-10 19:47:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,800 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. [2020-02-10 19:47:10,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2020-02-10 19:47:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:10,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,800 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 714 times [2020-02-10 19:47:10,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475956793] [2020-02-10 19:47:10,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,001 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:47:11,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475956793] [2020-02-10 19:47:11,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:11,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832382614] [2020-02-10 19:47:11,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:11,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:11,003 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand 8 states. [2020-02-10 19:47:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,060 INFO L93 Difference]: Finished difference Result 58 states and 98 transitions. [2020-02-10 19:47:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:11,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,061 INFO L225 Difference]: With dead ends: 58 [2020-02-10 19:47:11,061 INFO L226 Difference]: Without dead ends: 39 [2020-02-10 19:47:11,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-02-10 19:47:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-02-10 19:47:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 19:47:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2020-02-10 19:47:11,063 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 19 [2020-02-10 19:47:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,063 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 68 transitions. [2020-02-10 19:47:11,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2020-02-10 19:47:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:11,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:11,064 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1654166366, now seen corresponding path program 715 times [2020-02-10 19:47:11,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194268880] [2020-02-10 19:47:11,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,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:47:11,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194268880] [2020-02-10 19:47:11,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:11,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815206322] [2020-02-10 19:47:11,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:11,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:11,268 INFO L87 Difference]: Start difference. First operand 39 states and 68 transitions. Second operand 8 states. [2020-02-10 19:47:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,306 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2020-02-10 19:47:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:11,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,307 INFO L225 Difference]: With dead ends: 58 [2020-02-10 19:47:11,307 INFO L226 Difference]: Without dead ends: 48 [2020-02-10 19:47:11,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-02-10 19:47:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2020-02-10 19:47:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 19:47:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-02-10 19:47:11,309 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 19 [2020-02-10 19:47:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,309 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-02-10 19:47:11,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-02-10 19:47:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:11,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:11,310 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash 798859712, now seen corresponding path program 716 times [2020-02-10 19:47:11,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477800730] [2020-02-10 19:47:11,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,517 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:47:11,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477800730] [2020-02-10 19:47:11,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:11,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960448329] [2020-02-10 19:47:11,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:11,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:11,519 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 8 states. [2020-02-10 19:47:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,575 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-02-10 19:47:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:11,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,575 INFO L225 Difference]: With dead ends: 60 [2020-02-10 19:47:11,576 INFO L226 Difference]: Without dead ends: 46 [2020-02-10 19:47:11,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-02-10 19:47:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2020-02-10 19:47:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 19:47:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-02-10 19:47:11,577 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 19 [2020-02-10 19:47:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,577 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-02-10 19:47:11,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-02-10 19:47:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:11,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:11,578 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:11,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 717 times [2020-02-10 19:47:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71774910] [2020-02-10 19:47:11,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,798 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:47:11,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71774910] [2020-02-10 19:47:11,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:11,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002779181] [2020-02-10 19:47:11,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:11,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:11,800 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 8 states. [2020-02-10 19:47:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,838 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2020-02-10 19:47:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:11,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,839 INFO L225 Difference]: With dead ends: 54 [2020-02-10 19:47:11,839 INFO L226 Difference]: Without dead ends: 44 [2020-02-10 19:47:11,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-02-10 19:47:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-02-10 19:47:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 19:47:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-02-10 19:47:11,840 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 19 [2020-02-10 19:47:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,841 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-02-10 19:47:11,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-02-10 19:47:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:11,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:11,841 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash 459545024, now seen corresponding path program 718 times [2020-02-10 19:47:11,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723173923] [2020-02-10 19:47:11,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,060 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:47:12,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723173923] [2020-02-10 19:47:12,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:12,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216521454] [2020-02-10 19:47:12,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:12,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:12,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:12,061 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 8 states. [2020-02-10 19:47:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:12,128 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2020-02-10 19:47:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:12,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:12,129 INFO L225 Difference]: With dead ends: 48 [2020-02-10 19:47:12,129 INFO L226 Difference]: Without dead ends: 33 [2020-02-10 19:47:12,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-02-10 19:47:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-02-10 19:47:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-02-10 19:47:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2020-02-10 19:47:12,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 19 [2020-02-10 19:47:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,131 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2020-02-10 19:47:12,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2020-02-10 19:47:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:12,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:12,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:12,131 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash -274225668, now seen corresponding path program 719 times [2020-02-10 19:47:12,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:12,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024256524] [2020-02-10 19:47:12,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,334 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:47:12,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024256524] [2020-02-10 19:47:12,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:12,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921284275] [2020-02-10 19:47:12,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:12,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:12,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:12,335 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 8 states. [2020-02-10 19:47:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:12,389 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2020-02-10 19:47:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:12,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:12,389 INFO L225 Difference]: With dead ends: 41 [2020-02-10 19:47:12,390 INFO L226 Difference]: Without dead ends: 29 [2020-02-10 19:47:12,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-02-10 19:47:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-02-10 19:47:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-02-10 19:47:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-02-10 19:47:12,391 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2020-02-10 19:47:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,391 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-02-10 19:47:12,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-02-10 19:47:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-02-10 19:47:12,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:12,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:12,392 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 720 times [2020-02-10 19:47:12,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544423079] [2020-02-10 19:47:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,592 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:47:12,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544423079] [2020-02-10 19:47:12,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-02-10 19:47:12,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342511242] [2020-02-10 19:47:12,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-02-10 19:47:12,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-02-10 19:47:12,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-02-10 19:47:12,593 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. [2020-02-10 19:47:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:12,642 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-02-10 19:47:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-02-10 19:47:12,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-02-10 19:47:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:12,643 INFO L225 Difference]: With dead ends: 28 [2020-02-10 19:47:12,643 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 19:47:12,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-02-10 19:47:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 19:47:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 19:47:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 19:47:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 19:47:12,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-02-10 19:47:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,644 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 19:47:12,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-02-10 19:47:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 19:47:12,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 19:47:12,647 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:47:12 BasicIcfg [2020-02-10 19:47:12,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:47:12,648 INFO L168 Benchmark]: Toolchain (without parser) took 209886.09 ms. Allocated memory was 139.5 MB in the beginning and 216.5 MB in the end (delta: 77.1 MB). Free memory was 121.4 MB in the beginning and 122.8 MB in the end (delta: -1.4 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. [2020-02-10 19:47:12,649 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 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:47:12,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.56 ms. Allocated memory is still 139.5 MB. Free memory was 121.2 MB in the beginning and 119.4 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:47:12,649 INFO L168 Benchmark]: Boogie Preprocessor took 22.96 ms. Allocated memory is still 139.5 MB. Free memory was 119.4 MB in the beginning and 118.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 19:47:12,649 INFO L168 Benchmark]: RCFGBuilder took 282.46 ms. Allocated memory is still 139.5 MB. Free memory was 118.2 MB in the beginning and 106.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-02-10 19:47:12,649 INFO L168 Benchmark]: TraceAbstraction took 209538.15 ms. Allocated memory was 139.5 MB in the beginning and 216.5 MB in the end (delta: 77.1 MB). Free memory was 105.6 MB in the beginning and 122.8 MB in the end (delta: -17.2 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. [2020-02-10 19:47:12,651 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 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 36.56 ms. Allocated memory is still 139.5 MB. Free memory was 121.2 MB in the beginning and 119.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.96 ms. Allocated memory is still 139.5 MB. Free memory was 119.4 MB in the beginning and 118.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 282.46 ms. Allocated memory is still 139.5 MB. Free memory was 118.2 MB in the beginning and 106.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209538.15 ms. Allocated memory was 139.5 MB in the beginning and 216.5 MB in the end (delta: 77.1 MB). Free memory was 105.6 MB in the beginning and 122.8 MB in the end (delta: -17.2 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.3s, 52 ProgramPointsBefore, 45 ProgramPointsAfterwards, 63 TransitionsBefore, 56 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 210 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 225 CheckedPairsTotal, 7 TotalNumberOfCompositions - PositiveResult [Line: 25]: 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 7 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. Result: SAFE, OverallTime: 209.2s, OverallIterations: 724, TraceHistogramMax: 1, AutomataDifference: 56.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 48598 SDtfs, 89022 SDslu, 114886 SDs, 0 SdLazy, 25831 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5772 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 5044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 163.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred 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: 3.8s AutomataMinimizationTime, 724 MinimizatonAttempts, 91280 StatesRemovedByMinimization, 714 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 143.6s InterpolantComputationTime, 13756 NumberOfCodeBlocks, 13756 NumberOfCodeBlocksAsserted, 724 NumberOfCheckSat, 13032 ConstructedInterpolants, 0 QuantifiedInterpolants, 4750668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 724 InterpolantComputations, 724 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...